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)

#include <stdio.h>
#include <string.h>

int a[1000000];
int memo[1000000];

int partial_sum(int array[], int now, int i, int n);
int judge(int x, int y);

int main(void)
{
	int n, now;
	int i, j, k;
	int ans;
	
	while (scanf("%d", &n), n){
		memset(a, 0, sizeof(a));
		memset(memo, 0, sizeof(memo));
		
		ans = 0;
		
		for (i = 0; i < n; i++){
			scanf("%d", &a[i]);
		}
		
		now = 0;
		for (i = 0; i < n; i++){
			for (j = n - 1, k = 0; j >= 0; j--, k++){
				ans = judge(ans, partial_sum(a, now, k, n));
			}
			now++;
		}
		
		printf("%d\n", ans);
	}
	
	return (0);
}

int partial_sum(int array[], int now, int i, int n)
{
	
	if (now + i < n){
		memo[now] += array[now + i];
	}
	
	return (memo[now]);
}

int judge(int x, int y)
{
	if (x >= y){
		return (x);
	}
	else {
		return (y);
	}
}