HDU 1003

Max Sum

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

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<cstdio>
#include<cstring>

const int MAX=100003;
int dp[MAX],left[MAX];

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,i,j;
    bool flag=true;
    scanf("%d",&n);
    for(j=1;j<=n;j++)
    {
        if(flag)
            flag=false;
        else
            printf("\n");
        memset(dp,0,sizeof(dp));
        memset(left,0,sizeof(left));
        left[0]=1;
        int m;
        scanf("%d",&m);
        for(i=1;i<=m;i++)
        {
            int temp;
            scanf("%d",&temp);
            if(dp[i-1]>=0)
            {
                left[i]=left[i-1];//继承上面的最左边值
                dp[i]=dp[i-1]+temp;//继承上面的最大值，继续增加
            }
            else
            {
                left[i]=i;//灵气最左边值
                dp[i]=temp;//另起炤炉
            }
        }

	//求出dp的最大值
        int max=-10000,maxf=0;
        for(i=1;i<=m;i++)
        {
            if(dp[i]>max)
            {
                max=dp[i];
                maxf=i;
            }
        }
        printf("Case %d:\n",j);
        printf("%d %d %d\n",max,left[maxf],maxf);
    }
    return 0;
}