pku 2593
2009-11-27 12:52
190 查看
#include<stdio.h> #include<string.h> const int size = 100002; const int MININT = -99999999; int N, A[size], B[size], C[size]; int main() { int i, temp, sum; while (scanf("%d",&N)!=EOF) { if (!N)break; temp = 0; sum = MININT; for (i = 1; i <= N; i++) { scanf("%d", &A[i]); if (temp >= 0) temp += A[i]; else temp = A[i];/*不要来个0啊*/ if (temp > sum) B[i] = sum = temp; else B[i] = sum; } temp = 0, sum = MININT; for (i = N; i >= 1; i--) { if (temp >= 0) temp += A[i]; else temp = A[i]; if (temp > sum) C[i] = sum = temp; else C[i] = sum; } temp = B[1]+C[2]; for (i = 2; i < N; i++) if (temp < B[i] + C[i+1]) temp = B[i] + C[i+1]; printf("%d/n", temp); } return 0; }
相关文章推荐
- pku 2593
- PKU 2593 Max Sequence
- pku2593--Max Sequence
- PKU 1019 Number Sequence(模拟,思维)
- ACM题目分类总结及pku题目分类
- 并查集 PKU 1611
- POJ 2593 Max Sequence 解题报告
- DFS + 剪枝 PKU 1088
- PKU 2084 Game of Connections
- poj pku图论、网络流入门题总结、汇总(转)
- PKU 3468 A Simple Problem with Integers
- 北大PKU在线测试1007
- PKU C++程序设计实习 学习笔记3 多态与虚函数
- PKU Campus 2015 E:Transformation
- PKUSC2015总结
- PKU A Simple Problem with Integers (段树更新间隔总和)
- BZOJ1895: Pku3580 supermemo
- PKU 1276 Cash Machine
- [BZOJ3212] Pku3468 A Simple Problem with Integers
- 线段树系列-pku-3468-A Simple Problem with Integers-区间修改区间求和