HDU 1003 Max Sum

Max Sum

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

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<stdio.h>
#include<string.h>
int a[100005],sum[100005];
int main()
{
    //freopen("input.txt","r",stdin);
    int t,n,i,max,s,e,x=0,ts,te;
    scanf("%d",&t);
    while(t--)
    {
        if(x) printf("\n");
        scanf("%d",&n);
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]); 
        memset(sum,0,sizeof(sum));
        sum[1]=a[1],max=sum[1],ts=te=s=e=1;
        for(i=2;i<=n;i++)
        {
            if((sum[i-1]+a[i])>=a[i])
            {
                sum[i]=sum[i-1]+a[i];
                te=i;
                
            }
            else 
            {        
                sum[i]=a[i];
                ts=te=i;        
            }
            if(max<sum[i]) 
            {
                max=sum[i];
                s=ts;
                e=te;
            }
             
        } 
        printf("Case %d:\n%d %d %d\n",++x,max,s,e);
    }
    
//    fclose(stdin);
    return 0;
}