Maximum Continuous Sum in an Array

Question

Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$.

23 4 -10 2 15 1

Answer is 35.

Comments

ok i got  the idea from ur answer sir...i will try it .

---

See again, I had written wrong earlier :O

---

@Arjun sir please check out this one if that will work.

 

#include <stdio.h>

int main(void) {
   int n;
   int i;
   int sum = 0;
   int max = 0;
   int *arr = malloc(sizeof(int)*n);
   scanf("%d",&n);
   for(i = 0; i<n; i++){
       scanf("%d ",&arr[i]);
   }
   
   for(i = 0; i<n;i++){
           sum+=arr[i];
           if(sum<0) sum = 0;
           if(max<sum) max = sum;
   
   }
   
   printf("%d",max);
    return 0;
}

Answer 1

I asked this question to explain dynamic programming. I hope question is clear. Okay now, our challenge is to find the start and end of a subarray in the given array so that sum is maximum. i.e., given array

$$A[1..n]$$,

we have to find $i$ and $j$ such that $\sum_{k=i}^j A[k]$ is maximum. (Well, we don't need to output $i$ and $j$ but just the corresponding sum).

Okay, so one important thing is we are looking at "subarray" and not "subsequence" and hence the elements in the required subarray must be continuous. This makes the problem harder (subsequence solution will just be the sum of all positive array numbers).

Now, lets see if the problem has any sub-part which can be solved and which overlaps (if so we can do dynamic programming).

So, let me take an array element - say $A[i]$. There are only 2 choices for it- either it is in the required subsequence or it is not. So what is the condition for inclusion?

1. Let us assume the array ends at i for now.
2. We include A[i] in our required subarray, if the sum of the subarray ending at i-1 + A[i] produces a sum greater than any other subarray.

Well, the second statement here is the key- it gives our problem sub problems and moreover they are overlapping. So, lets try to apply it. What we need is an array say "sum" to store the max continuous sum for each position of the array ($sum[i]$ gives the maximum sum of the substring ending at $i$)  and one more element say MAXS, which stores the max sum seen so far. Now, we can say

sum[i] = max(sum[i-1] + A[i], A[i]);
if (sum[i] > MAXS), MAXS = sum[i];

with sum[1] = A[1] and MAXS = A[1] as the boundary conditions. 

Now, trying to code this? - 10 lines? :P

Comments

arjun sir, scroll back to check by answer i have updated it...u plz check the dynamic prgamming is correctly implemented in program or not.

---

yes, it looks correct :)

---

yes..i hav done in less than 10 lines

Answer 2

Go through this link..

http://www.geeksforgeeks.org/largest-sum-contiguous-subarray/