View Code of Problem 19

#include<iostream>
#include<vector>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
	return a<b;
}
int main()
{
	int n;
	while (cin >> n)
	{
		int a[1000],dp[1000];
		if (n == 0)
			break;
		else
		{
			
			for (int i = 0;i < n;i++)
			{
				cin >> a[i];
			}
			dp[0] = a[0];
			for (int i = 0;i < n-1;i++)
			{
				if (dp[i] > 0)
					dp[i + 1] = dp[i] + a[i + 1];
				else
					dp[i + 1] = a[i + 1];
			}
			sort(dp, dp + n);
			printf("%d\n", dp[n-1]);
		}
	}
}