hdu1003

最新推荐文章于 2021-03-04 03:56:45 发布

oopslb

最新推荐文章于 2021-03-04 03:56:45 发布

阅读量181

点赞数

分类专栏：其他dp

本文链接：https://blog.csdn.net/imzxww/article/details/76405990

版权

其他dp 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Max Sum

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

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
      
      
      
      

      
      
      
      
       
       思路：这题题意就是找最大连续子序列的和，可以用dp做，如果dp[i-1]+a[i]>a[i]则dp[i]=dp[i-1]+a[i],如果不是的话dp[i]=a[i],还需要用四个数来记录最大和的起始和重点位置。
      
      
      
      

      
      
      
      
       
       代码：
      
      
      
      
       
       #include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define ma(a) memset(a,0,sizeof(a))
#define ll long long
int dp[100005];
int a[100005];
int main()
{
    int T;
    cin>>T;
    int k=1;
    while(T--)
    {
        int n;
        scanf("%d",&n);
        int i;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        ma(dp);
        dp[1]=a[1];
        int x=1,y=1,s=1,e=1;
        int maxm=dp[1];
        for(i=2;i<=n;i++)
        {
            if(dp[i-1]+a[i]>=a[i])
            {
                dp[i]=dp[i-1]+a[i];
                e=i;
            }
            else
            {
                dp[i]=a[i];
                s=i;
                e=i;
            }
            if(dp[i]>maxm)
            {
                maxm=dp[i];
                x=s;
                y=e;
            }
        }
        printf("Case %d:\n",k++);
        cout<<maxm<<' '<<x<<' '<<y<<endl;
        if(T!=0)
        {
            cout<<endl;
        }
    }
    return 0;
}