HDU1003---Max Sum

最新推荐文章于 2019-11-02 12:23:45 发布

心向阳光2014

最新推荐文章于 2019-11-02 12:23:45 发布

阅读量340

点赞数

分类专栏： HD 水题

本文链接：https://blog.csdn.net/lv414333532/article/details/47668005

版权

水题同时被 2 个专栏收录

20 篇文章 0 订阅

订阅专栏

6 篇文章 0 订阅

订阅专栏

Max Sum

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

最大连续和；

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

Author

Ignatius.L

Recommend

We have carefully selected several similar problems for you: 1176 1087 1069 2084 1058

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<cctype>
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e5;
int dp[N+10];
int main()
{
    int t,n;
    int l,r;
    int sum;
    int tmp;
     while(~scanf("%d",&t))
     {
         int k=0;
         while(t--)
         {
             sum=-INF;
             scanf("%d",&n);
             for(int i=1;i<=n;i++)
             {
                 scanf("%d",&dp[i]);
             }
             int pos=1,p;
            while(pos<=n)
            {
                tmp=dp[p=pos];
                while(tmp>=0&&pos<n)
                {
                  tmp+=dp[++pos];
                  if(dp[pos]>0&&tmp>sum)
                  {
                      l=p;
                      r=pos;
                      sum=tmp;
                  }
                }
                if(tmp>sum)
                  {
                      l=p;
                      r=pos;
                      sum=tmp;
                  }
                pos++;
            }
            printf("Case %d:\n",++k);
            printf("%d %d %d\n",sum,l,r);
                if(t)
                    printf("\n");
         }
     }
    return 0;
}