hdu 1003

最新推荐文章于 2020-01-06 19:43:10 发布

深度抽象

最新推荐文章于 2020-01-06 19:43:10 发布

阅读量2.1k

点赞数 1

分类专栏： ACM解题报告动态规划文章标签： output integer input each

本文链接：https://blog.csdn.net/wwwzys/article/details/6757339

版权

ACM解题报告动态规划专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Max Sum

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

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

简单动态规划

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int r[100001];
int t;
int n;
int MAX;


int getMin()
{
    MAX=-9999;
    int j;
    for(int i=1;i<=n;i++)
    {
        if(MAX<r[i])
        {
            MAX=r[i];
            j=i;
        }
    }
    return j;
}


int main()
{
    int i,j,k,m,s1,s,e,sum;
    bool tag;
    scanf("%d",&t);
    for(m=1;m<=t;m++)
    {
        scanf("%d",&n);
        tag=true;
        s=e=1;
        MAX=-9999;
        sum=0;
        s1=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&r[i]);
            if(r[i]>=0)tag=false;
            sum+=r[i];
            if(sum<0)
            {
                sum=0;
                s1=i;
            }
            else
            {
                if(sum>MAX)
                {
                    MAX=sum;
                    e=i;
                    s=s1+1;
                }
            }
        }
        if(tag)
        {
            s=getMin();
            printf("Case %d:\n%d %d %d\n",m,MAX,s,s);
        }else
        {
            printf("Case %d:\n%d %d %d\n",m,MAX,s,e);
        }
        if(m<t)printf("\n");
    }
    return 0;
}