HDU 1003
来源:互联网 发布:数控编程培训靠谱吗 编辑:程序博客网 时间:2024/06/17 05:24
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
考虑一个“对于前n个数最大的必须到达末尾的连续子序列”,我就把简称为MESS(Max end sub-sequence)
例如“6 -1 5 4 -7”这个数列,对于前3个数“6 -1 5”,它从末尾出发,设其和最大的子序列为MESS[3],
那么对于前四个“6 -1 5 4”,MESS[4]= ( (MESS[3]>0) ? (MESS[3]+num[4]) : (num[4]) );
另外,最后遍历MESS数组,找到最大的那个值就是answer,那个位置就是子序列的末尾位置,另外为了记录子序列的开始位置,我把MESS定义成了结构体……里面定义一个sum用来存最大的和,另外定义一个begin来储存开始位置。
#include<cstdio>int num[100003];typedef struct{int sum;int begin;}type;type MESS[100003];int main(){int t,n;scanf("%d",&t);for(int kase=1;kase<=t;kase++){scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",&num[i]);MESS[1].sum=num[1];MESS[1].begin=1;for(int i=2;i<=n;i++){if(MESS[i-1].sum<0){MESS[i].sum=num[i];MESS[i].begin=i;}else{MESS[i].sum=MESS[i-1].sum+num[i];MESS[i].begin=MESS[i-1].begin;}}type max=MESS[1];int end=1;for(int i=2;i<=n;i++) if(max.sum<=MESS[i].sum) {max=MESS[i];end=i;}if(kase>=2) printf("\n");printf("Case %d:\n%d %d %d\n",kase,max.sum,max.begin,end);}}
0 0
- HDU-1231&HDU-1003
- HDU 1003
- hdu 1003
- hdu 1003
- HDU 1003
- HDU 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- HDU-1003
- HDU 1003
- hdu 1003
- HDU 1003
- 新世纪万年历
- 来来来 写一个二分查找 315. Count of Smaller Numbers After Self
- JNI详解---从不懂到理解
- 机器学习面试2
- poj 1269 Intersecting Lines
- HDU 1003
- Java反射机制详解
- 【经典智力题】1024! 末尾有多少个0?——“计算阶乘末尾0的数量”问题引出
- Android中使用动态代理模式
- Atitit需求文档模板大纲目录 attilax总结
- Spring-MVC框架下对web.xml文件及spring_mvc.xml文件内容的释义资料整理
- python的数学运算符
- vue2.0 中上传文件
- 单例模式-注意线程安全