poj 2593Max Sequence【dp】

最新推荐文章于 2019-03-28 10:23:41 发布

坚定的水手

最新推荐文章于 2019-03-28 10:23:41 发布

阅读量314

点赞数

本文链接：https://blog.csdn.net/liu6886/article/details/49892863

版权

Max Sequence

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 16666		Accepted: 6980

Description

Give you N integers a1, a2 ... aN (|ai| <=1000, 1 <= i <= N).

You should output S.

Input

The input will consist of several test cases. For each test case, one integer N (2 <= N <= 100000) is given in the first line. Second line contains N integers. The input is terminated by a single line with N = 0.

Output

For each test of the input, print a line containing S.

Sample Input

5
-5 9 -5 11 20
0

Sample Output

#include<cstring>
#include<cstdio>
#include<cstdlib>
const int M = 1e5+20;
int a[M], b[M], c[M];
int main()
{
	int n;
	while(scanf("%d", &n)==1, n)
	{
		int i, j, k;
		int r, t;
		r = 0;
		t = -1001;
		for(i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
			r += a[i];
			if(r > t)
				t = r;
			if(r < 0)
				r = 0;
			b[i] = t;		
		}
		r = 0;
		t = -1001;
		for(i = n-1; i >= 0; i--)
		{
			r += a[i];
			if(r > t)
				t = r;
			if(r < 0)
				r = 0;
			c[i] = t;		
		}
		int mx = b[0]+c[1];
		for(i = 0; i < n-1; i++)
		{
			if(mx < b[i]+c[i+1])
				mx = b[i]+c[i+1];
		}
		printf("%d\n", mx);
	} 
	return 0;
}