Question

(C programming) Given a sequence of numbers a₁, a₂, a₃, ..., a_n, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.

Input

The input consists of multiple datasets. Each data set consists of:

n
a1
a2
.
.
an

You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ a_i ≤ 100000.

The input end with a line consisting of a single 0.

Output

For each dataset, print the maximum sum in a line.

Sample Input

7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0

Output for the Sample Input

19
14
1001

Answer 1

Kadane's algorithm has been used here to find the maximum sum of contiguous array

Editable Code:

# include <stdio.h>

//Implementation of Kadane's algorithm
int maxContiguousSum(int a[], int size) {
int max_ending_here = 0, max_so_far = 0,i;
for ( i = 0; i < size; i++){
max_ending_here = max_ending_here + a[i];
if (max_ending_here < 0)
max_ending_here = 0;

   else if (max_so_far < max_ending_here)
max_so_far = max_ending_here;
}
return max_so_far;
}

int main(){
  
   int n;
   scanf("%d", &n);
   if(n>0){
       do{
           int a[5000];
           int i;
           for(i = 0;i<n;i++){ //Taking array input
               scanf("%d", &a[i]);
           }
           printf("%d\n",maxContiguousSum(a,n)); //Calling the fuction to print max sum
           scanf("%d", &n); //Size of next array
       }while(n>0); //Loop runs if size of next array is greater than 0
   }
return 0;
}

Hope this helps
If you have any doubt feel free to comment
Thank You!!