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: Memory Limit Exceeded)

#include <stdio.h>
#include <string.h>
int a[5000][5000];
int main(void){
  int n,i,j,k,ans=-100001;
  while(1){  
    scanf("%d",&n);
    if(!n)
      break;
    memset(a,0,sizeof(a));
    for(i=0;i<n;i++)
      scanf("%d",&a[0][i]);
    for(i=1;i<n;i++){
      for(j=0;j<n-i;j++){
	a[i][j]=a[i-1][j]+a[0][i+j];
      }
    }
    for(i=0;i<n;i++){
      for(j=0;j<n;j++){
	if(ans<a[i][j])
	  ans=a[i][j];
      }
    }
    printf("%d\n",ans);
  }
  return 0;
}