Problem:
Maximum Sum Sequence

Given a sequence of numbers a1, a2, a3, ..., an, 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 ≤ ai ≤ 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

Solution in C (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main (void){
  
    int number;
    int l = 0;
    int i,j,k;
    while(scanf("%d",&number),number)
    {
        int a[5010] = {0};
        int tempmax2[5010] = {0};
        int temp = 0;
        for(i = 0; i<number;i++)
        scanf("%d",&a[i]);
        for( j = 0; j<number;j++)
            for( k = j;k<number;k++)
            {
                for( l = k;l<number;l++)
                {
                    if(k == l)
                        tempmax2[k] = a[k];
                    else{
                        
                        tempmax2[k] += a[l];
                    }
                    if(temp <= tempmax2[k])
                        temp = tempmax2[k];
                }
            }
        printf("%d\n",temp);
    }
    return 0;
}