码迷,mamicode.com
首页 > 其他好文 > 详细

HDU - 1003 Max Sum (思维 || 动态规划)

时间:2019-04-08 01:00:01      阅读:189      评论:0      收藏:0      [点我收藏+]

标签:cst   [1]   esc   ase   out   size   integer   while   event   

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
 
题意:
最大区间和
思路1:暴力
把前面的加在一起,如果和变成了负数,那么后面的数再求区间和就没必要带上前面的那一坨了,如果还不是负数,把前面看成一个整体,一定是带上更优的。
技术图片
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int num[100086];
int main()
{
    int T;
    scanf("%d",&T);
    int cases=0;
    while(T--){
        cases++;
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&num[i]);
        }
        int l=1,r=1;
        int x,y;
        int maxx=-999999999,sum=0;
        for(int i=1;i<=n;i++){
            sum+=num[i];
            if(sum>maxx){
                x=l;y=i;
                maxx=sum;
            }
            if(sum<0){sum=0;l=i+1;}
        }
        if(cases!=1){printf("\n");}
        printf("Case %d:\n",cases);
        printf("%d %d %d\n",maxx,x,y);
    }
}
View Code

思路2:DP

我还不会,明日更新

HDU - 1003 Max Sum (思维 || 动态规划)

标签:cst   [1]   esc   ase   out   size   integer   while   event   

原文地址:https://www.cnblogs.com/ZGQblogs/p/10668162.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!