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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main{

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line;
		int n;
		int[] arr = new int[5001];
		
		while ((line = br.readLine()) != null) {
			if (line.equals("0"))
				break;
			
			n = Integer.parseInt(line);
			int sum = 0;
			int a;
			arr[0] = 0;
			for (int i = 1; i <= n; i++) {
				a = Integer.parseInt(br.readLine());
				sum += a;
				arr[i] = sum;
			}
			
//			System.out.println(Arrays.toString(arr));
			
			int ans = -999999999;
			for (int i = 1; i <= n; i++) {
				for (int j = i; j <= n; j++) {
					if (ans < arr[j] - arr[i - 1])
						ans = arr[j] - arr[i - 1];
				}
			}
			
			System.out.println(ans);
		}
	}

}