hdu---1024Max Sum Plus Plus(动态规划)

Max Sum Plus Plus

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

Problem Description

Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. Given a consecutive number sequence S1, S2, S3, S4 ... Sx, ... Sn (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ Sx ≤ 32767). We define a function sum(i, j) = Si + ... + Sj (1 ≤ i ≤ j ≤ n). Now given an integer m (m > 0), your task is to find m pairs of i and j which make sum(i1, j1) + sum(i2, j2) + sum(i3, j3) + ... + sum(im, jm) maximal (ix ≤ iy ≤ jx or ix ≤ jy ≤ jx is not allowed). But I`m lazy, I don't want to write a special-judge module, so you don't have to output m pairs of i and j, just output the maximal summation of sum(ix, jx)(1 ≤ x ≤ m) instead. ^_^

Input

Each test case will begin with two integers m and n, followed by n integers S1, S2, S3 ... Sn. Process to the end of file.

Output

Output the maximal summation described above in one line.

Sample Input

1 3 1 2 3

2 6 -1 4 -2 3 -2 3

Sample Output

6

8

Hint

Huge input, scanf and dynamic programming is recommended.

Author

JGShining(极光炫影)

 题意:

   给定一段连续数字串,要你求出m个连续子串的最大值。

 比如

   下面这个样列

    2  6 -1 4 -2 3 -2 3

    给出一个长度为6的连续数字串,要你求出这个串中连续的m=2个子串的子串之和.......

aa

-1

4

-2

3

-2

3

第一遍 maxc

-1

4

4

4

5

\

dp

-1

4

2

5

3

6

第二遍 maxc

-1

3

3

7

7

\

dp

-1

3

2

7

5

8

代码

 1 #include<iostream>
 2 #include<string.h>
 3 #include<stdio.h>
 4 using namespace std;
 5 int a[1000001],dp[1000001],max1[1000001];
 6  int max(int x,int y){
 7     return x>y?x:y;
 8 }
 9   int main(){
10     int i,j,n,m,temp;
11     while(scanf("%d%d",&m,&n)!=EOF)
12     {
13          dp[0]=0;
14         for(i=1;i<=n;i++)
15         {
16           scanf("%d",&a[i]);
17           dp[i]=0;
18           max1[i]=0;
19          }
20         max1[0]=0;
21         for(i=1;i<=m;i++){
22             temp=-0x3f3f3f3f;
23             for(j=i;j<=n;j++){
24                 dp[j]=max(dp[j-1]+a[j],max1[j-1]+a[j]);
25                 max1[j-1]=temp;
26                 temp=max(temp,dp[j]);
27             }
28         }
29         printf("%d\n",temp);
30     }
31     return 0;
32   }

 优化后的代码:

 1 /*hdu 1024 @coder Gxjun*/
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<cstring>
 5 #include<cstdlib>
 6 using namespace std;
 7 const int maxn=1000005;
 8 int aa[maxn],dp[maxn],maxc[maxn];
 9 int max(int a,int b){
10   return a>b?a:b;
11 }
12 int main()
13 {
14     int n,m,i,j,temp;
15     while(scanf("%d%d",&m,&n)!=EOF){
16         memset(maxc,0,sizeof(int)*(n+1));
17         memset(dp,0,sizeof(int)*(n+1));
18        for(i=1;i<=n;i++)
19           scanf("%d",&aa[i]);
20        for(i=1;i<=m;i++){
21           temp=-0x3f3f3f3f;
22        for(j=i;j<=n;j++){
23           dp[j]=max(dp[j-1],maxc[j-1])+aa[j];
24           maxc[j-1]=temp;
25           temp=max(temp,dp[j]);
26           }
27         }
28         printf("%d\n",temp);
29     }
30 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏小樱的经验随笔

HDU 2502 月之数(二进制,规律)

月之数 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...

34740
来自专栏小樱的经验随笔

POJ 2209 The King(简单贪心)

The King Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7499...

29140
来自专栏算法修养

HDU 5652 India and China Origins(并查集)

India and China Origins Time Limit: 2000/2000 MS (Java/Others)    Memory Limit:...

33070
来自专栏余林丰

简单说说装饰模式

这里只简单说说装饰模式,因为对这个模式理解得还不是很透彻。暂时不能写出更深一点的内容。 什么是装饰模式呢?拟定一个场景,一个人需要穿衣打扮,我们可以写一个Per...

19360
来自专栏ml

HDUOJ 2672---god is a girl 《斐波那契数》

god is a girl Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/3276...

28860
来自专栏数据结构与算法

POJ 2484 A Funny Game(智商博弈)

Description Alice and Bob decide to play a funny game. At the beginning of the ...

37580
来自专栏数据结构与算法

POJ 2891 Strange Way to Express Integers

Description Elina is reading a book written by Rujia Liu, which introduces a ...

34870
来自专栏ml

HDUOJ-------(1022)Train Problem I

Train Problem I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32...

31770
来自专栏码匠的流水账

聊聊HystrixPropertiesStrategy

hystrix-core-1.5.12-sources.jar!/com/netflix/hystrix/strategy/properties/Hystrix...

9310
来自专栏ml

hdu 4034 Graph (floyd的深入理解)

Graph Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Jav...

375110

扫码关注云+社区

领取腾讯云代金券