Max Sum
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 22 Accepted Submission(s) : 9
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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 -5
Sample Output
Case 1: 14 1 4 Case 2: 7 1 6 直接贴个代码了!#include <iostream> using namespace std; int main() { int test,n,temp,start,end,max,sum,x,i,j,count=0; scanf("%d",&test); while(test--) { count++; scanf("%d%d",&n,&temp); sum=temp; max=temp; start=1; end=1; x=1; for (j=2;j<=n;j++) { scanf("%d",&temp); if (sum+temp<temp) sum=temp,x=j; else sum+=temp; if (sum>max) max=sum,start=x,end=j; } cout<<"Case "<<count<<":"<<endl<<max<<" "<<start<<" "<<end<<endl; if (test>0) cout<<endl; } return 0; }