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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
// 0 1 ナップサック
class Main{
	public static void main(String[] args) {

		int[] value;
		int kazu=0;
		int kaisi=0,owari=0;
		int wa=0;
		int wa1_max=0;
		int total_max=0;
		BufferedReader bfr=new BufferedReader(new InputStreamReader(System.in));
		String str="";
		try {
			while(true) {
				str=bfr.readLine();
				kazu=Integer.parseInt(str);
				if(kazu==0) {
					System.exit(0);
				}
				else{
					value=new int[kazu];

					for(int i=0; i<kazu; i++) {
						str=bfr.readLine();
						value[i]=Integer.parseInt(str);
					}
					for(int i=0; i<kazu; i++) {
						kaisi=i;
						for(int j=i; j<kazu; j++) {
							wa+=value[j];
							if(wa>wa1_max) {
								wa1_max=wa;
								owari=j;
							}
							else {}
							if(wa1_max>total_max) {
								total_max=wa1_max;
							}
							else {}
						}
						wa1_max=0; wa=0;
					}
					System.out.println(total_max);
					total_max=0; kazu=0;
				}
			}
		}catch(IOException e) {
		}
	}
}