HDOJ 1003 Max Sum
2017-05-15 15:11
281 查看
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 244483 Accepted Submission(s): 57718
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>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <cctype>
#define N 100010
using namespace std;
int main()
{
int cas,n;
int a;
cin>>cas;
for(int i=1; i<=cas; i++)
{
cin>>n;
int sum=0,maxsum=-1001,first=0,last=0,temp=1;
for(int i=0; i<n; i++)
{
cin>>a;
sum+=a;
if(sum>maxsum)
{
maxsum=sum;
first=temp;
last=i+1;
}
if(sum<0)
{
sum=0;
temp=i+2;
}
}
cout<<"Case "<<i<<':'<<endl<<maxsum<<' '<<first<<' '<<last<<endl;
if(i!=cas)cout<<endl;
}
return 0;
}
相关文章推荐
- HDOJ 1003 Max Sum
- HDOJ1003:Max Sum
- HDOJ(1003) Max Sum
- hdoj1003-Max Sum(数组的最大和)
- hdoj1003 Max Sum (DP 最大子序列求和)
- HDOJ 1003 Max Sum
- HDOJ 1003 Max Sum
- hdoj 1003 Max Sum【dp】
- 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
- HDOJ 1003 Max Sum参考程序
- Hdoj 1003 Max Sum