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: Wrong Answer)

#include<stdio.h>
#include<string.h>
#include<stdlib.h>


int main(void)
{
  int n,i,j,k;
  long tmp,max;
  long *a;
  while(1){
    scanf("%d",&n);
    if(n==0)
      break;
    a=malloc(sizeof(long)*n);
    for(i=0;i<n;i++)
      scanf("%ld",&a[i]);
    //for(i=0;i<n;i++)
      //  printf("a[%d]=%ld\n",i,a[i]);
    max=a[0];
    tmp=0;
    for(i=0;i<n;i++){
      for(j=i;j<n;j++){  
	  tmp+=a[j];
  
	  //printf("tmp=%ld\n",tmp);
	  if(tmp>max)
	    max=tmp;
      }
      tmp=0;
    } 
   
    printf("max:%ld\n",max);
    free(a);
  }

  return 0;
}