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.*;
class Main{
	public static void main(String[] args)throws IOException{
		int n;
		BufferedReader br=
				new BufferedReader(new InputStreamReader(System.in));
		while((n=Integer.parseInt(br.readLine()))!=0){
			int[] data_set=new int[n];
			int max;
			max=data_set[0]=Integer.parseInt(br.readLine());
			for(int i=1;i<data_set.length;i++){
				max=Math.max(data_set[i]=(Integer.parseInt(br.readLine())),max);
			}
			for(int i=1;i<data_set.length;i++){
				for(int j=0;j<(data_set.length - i);j++){
					max=Math.max(max,calc_max(data_set,i,j));
				}
			}
			System.out.printf("%d\n",max);
		}
	}
	public static int calc_max(int[] data,int n,int m){
		int ans=0;
		for(int i=0;i<n+1;i++){
			ans+=data[m+i];
		}
		return ans;
	
	}		
}