View Code of Problem 19

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n;
	while (~scanf("%d", &n)&&n) {
		if (n == 0)
			break;
		int num[n], dp[n];
		dp[0] = num[0];
		for (int i = 0; i < n; i++)
			scanf("%d", &num[i]);
		for (int i = 0; i < n; i++) 
			dp[i] = max(dp[i - 1] + num[i], num[i]);
		sort(dp, dp + n);
		printf("%d\n", dp[n - 1]);
	}
	return 0;
}