max sum(DP)

最新推荐文章于 2021-08-17 00:15:46 发布

lrbj

最新推荐文章于 2021-08-17 00:15:46 发布

阅读量615

点赞数

分类专栏： 2013年5月 dp

本文链接：https://blog.csdn.net/JHC23/article/details/9005354

版权

dp 同时被 2 个专栏收录

41 篇文章 0 订阅

订阅专栏

2013年5月

28 篇文章 0 订阅

订阅专栏

/*http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=19572&pid=1004&hide=1&problem=Problem%20D
max sum

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 4 Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
Statistic | Submit | Back
解析：也是求最大连续和，受上一题的启示，转化成决策优化问题，所得结果如下
*/

1004

15 MS

624 KB

Visual C++

jingzuo

#include <stdio.h>
#include <string.h>

#include <math.h>
#include<iostream>
using namespace std;
const int maxn=100010;
int a[maxn];
int main()
{int T;
int n,t1,cnt,s1,i,j,sum,t;
int max;
cnt=0;
scanf("%d",&T);
while(T--)
{ scanf("%d",&n);
  memset(a,0,sizeof(a));
  max=-1001;
   for(i=1;i<=n;i++)
    { scanf("%d",&a[i]);
      if(a[i]>max)
         {
            max=a[i];
            s1=t1=i;
         }
      // printf("s[i]=%d\n",s[i]);
    }
    printf("Case %d:\n",++cnt);
    if(max<=0)//如果所有的值都是非正数的则取其最大一个即可
    {
        printf("%d %d %d\n",max,s1,t1);
        if(T>=1)
        printf("\n");
        continue;
    }
     max=a[1];
     sum=a[1];
     s1=t1=t=1;
    for(i=2;i<=n;i++)//决策过程（由于排除了全部为负数的情况，则其必然有出现最大和大于等于0的情况）
     {
         if(sum<0)//如果当前sum{a[1,,,,i]}小于零则需要改起始位置，及抛弃前面a[1...i-1]元素
         {
             sum=0;
             t=i;
         }
         sum+=a[i];
         if(max<sum)//求得最大值
         {
             max=sum;
             s1=t;
             t1=i;
         }

     }
     printf("%d %d %d\n",max,s1,t1);
     if(T>=1)
     printf("\n");
}
return 0;
}