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



import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int n = Integer.parseInt(sc.next());
			int i, p, maxsum = 0, minsf = 0;
			int[] a = new int[5001];
			int[] S = new int[5001];
			if(n == 0) {
				break;
			}
			for(i = 0; i < n; i++) {
				a[i] = Integer.parseInt(sc.next());
			}
			S[0] =  a[0];
			for(i = 1; i < n; i++) {
				S[i] = S[i - 1] + a[i];
			}
			maxsum=a[0]; minsf=a[0];
			for(p = 1; p < n; p++){
				if(S[p] - minsf > maxsum) maxsum = S[p] - minsf;
				if(S[p] < minsf) minsf = S[p];
			}
			System.out.println(maxsum);
		}
		sc.close();


	}

}