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: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication34
{
    class Program
    {
        static void Main()
        {
            while (true)
            {
                int w = int.Parse(Console.ReadLine());
                if (w == 0) break;
                List<int> s = new List<int>(); int r, l = int.MinValue;
                for(int x=0;x<w;x++)
                {
                    int a = int.Parse(Console.ReadLine());
                    s.Add(a);
                }
                for (int b = 0; b < s.Count; b++)
                {
                    r = 0;
                    for (int c = b; c < s.Count; c++)
                    {
                        r += s[c];
                        if (r > l) { l = r; }
                    }
                }
                Console.WriteLine(l);
            }
        }
    }
}