HDOJ 1003 Max Sum
2014-05-15 20:35
288 查看
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 136547 Accepted Submission(s): 31609
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<iostream> using namespace std; int main() { int temp,now,max,x,pos1,pos2; int n,t,i,j; cin>>n; for(j=0;j<n;j++) { cin>>t>>temp; now=max=temp; pos1=pos2=x=1; for(i=2;i<=t;i++) { cin>>temp; if(now+temp<temp) { now=temp; x=i; } else now+=temp; if(now>max) { max=now; pos1=x;pos2=i; } } cout<<"Case "<<j+1<<':'<<endl; cout<<max<<" "<<pos1<<" "<<pos2<<endl; if(j+1==n) break; cout<<endl; } system("pause"); return 0; }
相关文章推荐
- Max Sum--hdoj 1003 dp
- HDOJ1003.Max Sum
- HDOJ 1003 Max Sum(新手动态规划)
- hdoj 1003 Max Sum 【最大子段和】【贪心】
- 【算法】HDOJ-1003 Max Sum
- HDOJ 1003 Max Sum 杭电 ACM
- 杭电OJ(HDOJ)1003题:Max Sum(动态规划)
- hdoj 1003 Max Sum
- HDOJ 1003 Max Sum(动态规划)
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum 简单解题报告
- HDOJ1003 - Max Sum
- 最大子序列和 HDOJ 1003 Max Sum
- HDOJ 1003.Max Sum 答案
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- 【HDOJ】1003 Max Sum
- HDOJ1003 Max Sum
- (HDOJ 1003)Max Sum
- HDOJ-1003 Max Sum