View Code of Problem 19

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

	return 0;
}