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

import java.io.*;
import java.math.BigInteger;
import java.util.*;

class Main {
	
	public static int maxCalc (int[] nums) {
		
		int max = Integer.MIN_VALUE;
		int sum = 0;
		
		// いくつ連続でとるか
		for (int i = 1; i <= nums.length; i++) {
			
			// どこから取り始めるか
			for (int j = 0; j < nums.length - i + 1; j++) {
				
				sum = 0;
				int cnt = 0;
				
				// 取った数がiになるまで繰り返し
				for (int k = j; cnt < i; k++,cnt++) {
					sum += nums[k];
				}
				max = Math.max(sum, max);
				
			}
			
		}
		return max;
		
	}
	
	public static void main(String[] args) throws IOException {

		BufferedReader br =
			new BufferedReader(new InputStreamReader(System.in));
		
		ArrayList<Integer> ans = new ArrayList<Integer>();
		
		while (true) {
			
			int n = Integer.parseInt(br.readLine());
			if (n == 0) break;
			int[] nums = new int[n];
			for (int i = 0; i < n; i++)
				nums[i] = Integer.parseInt(br.readLine());
			ans.add(maxCalc(nums));
			
		}
		
		for (int a : ans) {
			System.out.println(a);
		}
		
	}

}