pku 2593
2010-03-26 19:42
190 查看
http://acm.pku.edu.cn/JudgeOnline/problem?id=2593
类似2479,一串最大连续和分割成两部分。
类似2479,一串最大连续和分割成两部分。
#include <iostream> using namespace std; int a[100001],l[100001],r[100002]; int main() { int n,sum,max; while(1) { scanf("%d",&n); if(n==0) break; l[0] = -10001; sum = 0; for(int i=1;i<=n;++i) { scanf("%d",&a[i]); if(l[i-1] > a[i]+sum) l[i]=l[i-1]; else l[i]=a[i]+sum; sum+=a[i]; if(sum<0) sum=0; } r[n+1] = -10001; sum = 0; max = -200000; for( i=n;i!=0;--i) { if(r[i+1] > a[i]+sum) r[i]=r[i+1]; else r[i]=a[i]+sum; sum+=a[i]; if(sum<0) sum=0; if(l[i]+r[i+1]>max) max = l[i]+r[i+1]; } printf("%d/n",max); } return 0; }
相关文章推荐
- pku 2593
- PKU 2593 Max Sequence
- pku2593--Max Sequence
- pku--3979 分数加减法(注意分子为0,分母为1的情况)
- PKU3710
- pku acm题目分类 (1)
- pku 2240 Arbitrage
- PKU 3129
- PKU 1177 Picture
- pku 2492 A Bug's Life
- pku 2378 Tree Cutting
- PKU 1723 SOLDIERS
- pku 2446 Chessboard
- pku1273 Drainage Ditches
- pku 1308 并查集应用
- DP——斜率优化专题(pku3709,hdu3669)
- pku2449第K短路 最短路+A*
- pku1080 Human Gene Functions
- pku 1041 John's trip
- pku 2455