关闭

poj 2593Max Sequence【dp】

122人阅读 评论(0) 收藏 举报

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

40

#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;
} 



0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:51021次
    • 积分:2346
    • 等级:
    • 排名:第15857名
    • 原创:183篇
    • 转载:2篇
    • 译文:0篇
    • 评论:17条
    最新评论