hdu1003

Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 95590    Accepted Submission(s): 22086

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

 

 

 

 

 

 

 

2. #include<iostream>
4. #include<cstdio>
6. using namespace std;
8. int main()
10. {  
12. int i,j=0,t;
14.  scanf("%d",&t);
16.  while(t--)
18.  {   
20. int  n,sum=0,max=-9999999,start,end=0,k=0,;
22.   scanf("%d",&n);   
24. for(i=0;i<n;i++)  
26.  {   
28.  int a; 
30.  scanf("%d",&a);  
32.   sum+=a;  
34.   if(sum>max)  
36.   {     
38. max=sum;    
40.  start=k+1;  
42.    end=i+1;   
44.  }    
46. if(sum<0)   
48.  {    
50.  sum=0;    
52.  k=i+1;   
54.  }  
56.  }        
58.   cout<<"Case "<<++j<<":"<<endl;    
60.            cout<<max<<" "<<start<<" "<<end<<endl;   
62.    if(t>0)     
64.   cout<<endl;
66.  }  
68. return 0;
70. }