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 C# (judge verdict: Wrong Answer)

using System;
namespace ConsoleApplication26
{
    class Program
    {
        static void Main(string[] args)
        {
            while (true)
            {
                String str = Console.ReadLine();
                if (str == "0")
                {
                    break;
                }
                int n = int.Parse(str);
                if (n == 0) break;
                int[] stock = new int[n * n];
                int[] list = new int[n];
                for (int i = 0; i < n; i++) list[i] = int.Parse(Console.ReadLine()); 
                int temp_i = 0;
                int cou=0;
                for (int i = 0; i < n; i++)
                {
                    temp_i = 0;
                    for (int m = i; m < n; m++)
                    {
                        temp_i = temp_i + list[m];
                        stock[cou] = temp_i;
                        cou++;
                    }
                }
                int temp = 0;
                for (int i = 0; i < stock.Length; i++) {
                    if (temp < stock[i]) {
                        temp = stock[i];
                    }
                }
                Console.WriteLine(temp);
            }
        }
    }
}