Hdu 1003 Max Sum

Max Sum

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 4   Accepted Submission(s) : 1

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

 

#include<iostream>#include<algorithm>using namespace std;int main(){int num,i,j,k=1;cin>>num;while(num--){int a[100005],sum=-1001,temp=0,x=-1,y=-1,n,x1=0,s=0,max=-1001,t;cin>>n;for(i=0;i<n;i++)cin>>a[i];for(i=0;i<n;i++){temp+=a[i];if(temp>sum){sum=temp;x=x1;y=i;}if(temp<0){temp=0;x1=i+1;}//cout<<x1<<endl;}cout<<"Case "<<k<<":"<<endl;k++;cout<<sum<<" "<<x+1<<" "<<y+1<<endl;if(num>0)cout<<endl; }}

Author

Ignatius.L