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 <string.h>
#include <limits.h>
 
int array[5000];

int main(void)
{
  int n, i, s, e, sum, max;
 
  while(1){
    /* ??????????????????????????? */
    memset(array, 0, sizeof(array));
 
    /* ??\??????????????????????????? */
    scanf("%d", &n);
    if(n == 0) break;   /* n???0?????£???????????? */

    /* n????????´??°??????????????? */
    for(i=0; i<n; i++){
      scanf("%d", &array[i]);
    }
 
    /* ?????§??????????????????????????°???????????? */
    max = INT_MIN;
 
    /* ??¨???????????¨??¢?´¢ */
    for(s=0; s<n; s++){
      for(e=s; e<n; e++){
        sum = 0;
        for(i=s; i<=e; i++){
          sum += array[i];
        }
        if(max < sum) max = sum;
      }
    }
 
    /* ???????????¨??? */
    printf("%d\n", max);
  }
 
  return 0;
}