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 JAVA (judge verdict: Accepted)

import java.util.*;import java.math.*;class Main{public static void main(String[]e){int n,i,j;BigInteger c,d,r;for(Scanner s=new Scanner(System.in);(n=s.nextInt())>0;){BigInteger[]a=new BigInteger[n];for(i=n,r=a[--i]=s.nextBigInteger();i-->0;){a[i]=s.nextBigInteger();for(j=n,c=d=BigInteger.ZERO;j-->i;)r=r.max(c=c.add(a[j])).max(d=d.add(a[i+n-j-1]));}System.out.println(r);}}}