Max Sum(dp水题)
2015-10-19 21:45
218 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1003
还是子序列求和
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 186386 Accepted Submission(s): 43487
Problem Description
Given a sequence a[1],a[2],a[3]......a
, your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence.
If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
Sample Output
还是子序列求和
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 186386 Accepted Submission(s): 43487
Problem Description
Given a sequence a[1],a[2],a[3]......a
, your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence.
If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
Sample Output
Case 1: 14 1 4 Case 2: 7 1 6
#include <cstdio> int main(){ int t; scanf("%d",&t); for(int Case=1;Case<=t;Case++){ int a,max_sum=-1001,max_first,max_last,tot=-1,last,first; int d; scanf("%d",&d); for(int i=1;i<=d;i++){ scanf("%d",&a); if(tot<0){ first=last=i; tot=a; } else { tot+=a;last=i; } if(tot>max_sum){ max_sum=tot; max_first=first; max_last=last; } } printf("Case %d:\n%d %d %d\n",Case,max_sum,max_first,max_last); if(Case!=t)printf("\n"); } return 0; }AC之路,我选择坚持~~
相关文章推荐
- Exception in thread "main" org.hibernate.HibernateException: save is not valid without active transa
- java 内存泄露
- 【原创】ReFlux细说
- makefile学习笔记------疑问篇
- UWP中新加的数据绑定方式x:Bind分析总结
- SVM大致思路整理
- leetcode之Excel Sheet Column Title
- qtxlsx读取excle的数据
- 面试中的算法准备
- 时间管理-SMART原则
- C++程序中调用其他exe可执行文件方法
- Deferred shading技术简介
- 又是一个APIHOOK
- 5-22 龟兔赛跑
- 2015年第一届中国大学生程序设计竞赛比赛总结
- 15.5 cv 10问10答?
- 操作系统学习笔记(2)——中断和异常
- 最小生成树的一些性质和理解
- 使用qtxlsx库读取excel表格中的数据
- linux的awk命令按列解析学习总结