HDOJ-1003 Max Sum
来源:互联网 发布:java写qq登入跳出聊天 编辑:程序博客网 时间:2024/06/06 03:14
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
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5Sample Output
Case 1:
14 1 4Case 2:
7 1 6
最大子序和问题。不过是要多存序列开头和结尾的位置。一次AC看代码吧。
//46MS 2068K#include<iostream>#include<cstdio>using namespace std;#define maxn 100005int main(){ int T,j=1; scanf("%d",&T); while(T--){ int N,S[maxn]; scanf("%d",&N); for(int i=1;i<=N;i++){ scanf("%d",&S[i]); } int sum=0,max=-1005,first=0,last=0,temp=1; for(int i=1;i<=N;i++){ sum+=S[i]; if(sum>max){ max=sum; first=temp; last=i; } if(sum<0){ sum=0; temp=i+1; } } printf("Case %d:\n%d %d %d\n",j++,max,first,last); if(T!=0) printf("\n"); } return 0;}
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- hdoj 1003 Max Sum
- HDOJ 1003 Max Sum
- hdoj 1003Max Sum
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- HDOJ--1003Max Sum
- hdoj 1003 Max Sum
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- hdoj 1003 Max Sum
- HDOJ Max Sum 1003
- 【HDOJ 1003】 Max Sum
- HDOJ 1003 ( Max Sum )
- 189. Rotate Array
- github上传文件的步骤
- tqdm使用方法
- android热修复实践-andfix
- Java中一些数据类型的相互转换
- HDOJ-1003 Max Sum
- 视频在线解析网站观看vip视频
- android控件自动化埋点统计
- hdu2039 三角形(C语言)
- 自制编程语言CXScript(二) 实现赋值语句和四则运算
- BZOJ 1692 [Usaco2007 Dec]队列变换 贪心+后缀数组
- 冒泡,选择,插入排序优化,堆排序和qsort的用法
- 迪杰斯特拉算法
- Ajax操作