杭电1003 Max Sum

最新推荐文章于 2021-01-26 20:14:08 发布

听自己心跳的声音

最新推荐文章于 2021-01-26 20:14:08 发布

阅读量581

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/u013634213/article/details/38434045

版权

数论专栏收录该内容

41 篇文章 0 订阅

订阅专栏

Max Sum

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

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
   
   /*
以前做过，不过好像一直没A掉
还好一次过了
注意点：遇到开始的最小值，先记下，当和大于最大值的时候在确定
Time:2014-8-8 8:59
*/
#include<stdio.h>
#include<string.h>
const int MAX=100000+10;
int main()
{
    int T;
    int a[MAX];
    int d=0;
    scanf("%d",&T);
    while(T--)
    {
       memset(a,0,sizeof(a));
       int N;
       scanf("%d",&N);
       for(int i=1;i<=N;i++)
       {
        scanf("%d",&a[i]);
       }
       int maxV=a[1];
       int start,end,k,sum=0;
       start=end=k=1;
       for (int i=1;i<=N;i++)
       {
           sum+=a[i];
           if (maxV<sum)
           {
              maxV=sum;
              start=k;
              end=i;
           }
           if(sum<0)
           {
            sum=0;
            k=i+1;         
           }    
       }
       printf("Case %d:\n%d %d %d\n",++d,maxV,start,end);
       if(T)printf("\n");
    }
return 0;
}