View Code of Problem 19

#include<stdio.h>

int main()
{
	long long n;
	int num[100005]={0};
	scanf("%lld", &n);
	while(n != 0)
	{
		for(int i = 0; i < n ; i++)
			scanf("%d", &num[i]);
		for(int i = 0; i < n; i++)
		{
			int m[100005] = {0};
			int max = num[i];
			m[i] = num[i];
			for(int j = i+1; j < n ; j++)
			{
				m[j] = m[j-1] + num[j];
				if(max < m[j])
					max = m[j];
			}
			num[i] = max;
		}
		int ans = num[0];
		for(int i = 1; i < n;  i++)
			if(ans < num[i])
				ans = num[i];
		printf("%d\n", ans);
		scanf("%lld", &n);
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 19