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>
#include<stdlib.h>

int main(void)
{

        int max = 0,bigmax = 0;
        short *a;
        int *sum,n=0;
        int i = 0,j = 0,k=0;

        while(1)
        {
                scanf("%d", &n);
                a=(short *)malloc(sizeof(short)*5000);
                if(n == 0)
                {
                        break;
                }
                for(i = 0; i < n; i++)
                {
                        scanf("%hd", &a[i]);
                }

                for(k = 0; k < n; k++)
                {
                        for(i = 0;i < n-k; i++)
                        {
                                sum=(int *)malloc(sizeof(int)*5000);
                                sum[i] = 0;
                                for(j = k; j < i+1; j++)
                                {
                                        sum[i]=sum[i]+a[j];
                                }
                                if(max < sum[i])
                                {
                                        max = sum[i];
                                }
                                free(sum);
                        }
                }
                printf("%d\n",max);
                max=0;
        }
        free(a);
        return 0;
}