hdu 1003 Max Sum
来源:互联网 发布:sql查询语句例题 编辑:程序博客网 时间:2024/05/21 06:17
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 116194 Accepted Submission(s): 26942
Problem Description
Given a sequence a[1],a[2],a[3]......a[n], 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
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6
Author
Ignatius.L
这个题目我做了很久,由于不会动归,所以请教别人才最后弄了出来;
分析:1 3 -5 -7 8
当遇到sum的和为<0,则sum=0;k=i+1,k的值赋值给初下标s1;s2则随循环移动记录,max值一定保持是最大的
#include<stdio.h>int main(){ int L,l,n,i,s1,s2,num[100005],max,sum; scanf("%d",&L); for(l=1;l<=L;l++) { scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&num[i]); max=-99999; int k=1; sum=0; for(i=1;i<=n;i++) { sum+=num[i]; if(sum>max) { max=sum; s1=k; s2=i; } if(sum<0) { sum=0; k=i+1; } } printf("Case %d:\n",l); if(l==L) printf("%d %d %d\n",max,s1,s2); else printf("%d %d %d\n\n",max,s1,s2); } return 0;}
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- hdu 1003 Max Sum
- HDU-1003 max sum
- HDU 1003 - Max Sum
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- HDU 1003 Max Sum
- hdu 1003 max sum
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- Hdu 1003 - Max Sum
- HDU-1003-Max Sum
- hdu - 1003 - Max Sum
- Qt好书推荐
- POJ 3648 Wedding(2-sat方案输出,4级)
- vim分割窗口
- UVA - 10154 Weights and Measures
- 机房收费系统(2)-问题因小见大
- hdu 1003 Max Sum
- nandflash传址原理
- Checkboxes(复选框),感觉这个都挺重要的!
- 计算机视觉、机器学习相关领域论文和源代码大集合(转)
- MyEclipse撤销已部署的Structs框架
- 提问的智慧
- 提交和复位按钮的知识(Submit & Reset Buttons)
- 再见,2012
- “收取金额,退还金额信息查询”窗体出现的一些问题