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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Scanner;

class Main {

    public static void main(String[] args) throws IOException {

        InputStreamReader sr = null;
        Scanner sc = null;
        int datasets = 0;
        List<Integer> list = new ArrayList<Integer>();
        int sum = 0;
        int max = 0;

        try {
            sc = new Scanner(sr = new InputStreamReader(System.in));

            while ((datasets = sc.nextInt()) != 0) {

                for (int i = 1; i <= datasets; i++) {

                    list.add(sc.nextInt());

                }

                max = list.get(0);

                for (int i = 0; i < list.size(); i++) {
                    for (int j = i; j < list.size(); j++) {

                        sum += list.get(j);
                        if (max < sum) {

                            max = sum;

                        }

                    }

                    sum = 0;

                }

                System.out.println(max);
                max = 0;
                list.removeAll(list);

            }

        } catch (NoSuchElementException e) {

        }

        finally {
            sr.close();
            sc.close();
        }

    }

}