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.InputStreamReader;
import java.util.ArrayList;

public class Main {
    public static void main(String[] args) {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        try {
            ArrayList<Integer> sumList;
            int tmp;
            while (true) {
                int n = Integer.parseInt(br.readLine());
                if (n == 0) {
                    System.exit(0);
                }
                tmp = 0;
                sumList = new ArrayList<>();
                sumList.add(0);
                for (int i = 0; i < n; i++) {
                    tmp += Integer.parseInt(br.readLine());
                    sumList.add(tmp);
                }

                int sum;
                int max = -100000 * 5000;
                for (int i = 0; i < sumList.size() - 1; i++) {
                    for (int j = i + 1; j < sumList.size() ; j++) {
                        sum = sumList.get(j) - sumList.get(i);
                        max = sum > max ? sum : max;
                    }
                }
                System.out.println(max);
            }
        } catch (Exception e) {
            e.printStackTrace();
        }

    }
}