杭电 1003--Max Sum(初级DP)

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>
int main()
{
 int ncase,n,i,j,k,str,end,t=1;
 int a[100002];
 int sum,max;
 scanf("%d",&ncase);
 while(ncase--)
 {
  scanf("%d",&n);
  for(i=1;i<=n;i++)
   scanf("%d",&a[i]);
  sum=max=a[1];
  k=1;
  str=end=1;
  for(j=2;j<=n;j++)//k为新的起点
  {
   if(sum<0)

   {
    sum=a[j];
    k=j;
   }
   
   else
    sum+=a[j];
   if(sum>max)
   {
    max=sum;
    str=k;
    end=j;
   }
   
  }
  printf("Case %d:\n",t);
   t++;
  if(ncase)
       printf("%d %d %d\n\n",max,str,end);
  else
   printf("%d %d %d\n",max,str,end);
 }
 return 0;
}