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;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace AthleteProgramming2
{
    class Program
    {
        static void Main(string[] args)
        {
            while (true)
            {
                int n = int.Parse(Console.ReadLine());

                if (n == 0)
                {
                    break;
                }
                int[] array = new int[n];
                for(int i = 0; i < n; i++)
                {
                    array[i] = int.Parse(Console.ReadLine());
                }
                int max = int.MinValue;
                int[] sArray = new int[n];
                for(int i = 0; i < n; i++)
                {
                   for(int k = 0; k <=i; k++)
                    {
                        sArray[i] += array[k];
                    }
                }
                for(int k = n - 1; k >= 0; k--)
                {
                    for(int i = 0; i < k; i++)
                    {
                        if (sArray[k] - sArray[i] > max)
                        {
                            max = sArray[k] - sArray[i];
                        }
                    }
                }
                Console.WriteLine(max);
                
            }
        }
    }

}