HDU 1024(DP+滚动数组)
来源:互联网 发布:淘宝红包链接怎么复制 编辑:程序博客网 时间:2024/05/29 18:05
Max Sum Plus Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29920 Accepted Submission(s): 10505
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(极光炫影)
Recommend
题意:求m个不相交子段的和的最大值
做法:
dp[i][j]=max(dp[i][j-1],dp[i-1][k])+s[j]
dp[i][j]表示以s[j]结尾的i个子段的最大和
结果是MLE
优化:滚动数组。当面状态只与i-1与i有关。我们可以开个2*n数组就够了
即:dp[1][j]=max(dp[1][j-1],dp[0][k])+s[j]
结果TLE
可以记录一下dp[0][k]的之前最大值来直接和dp[1][j-1]比较
即 dp[j]=max(dp[j-1],pre[j-1])+s[j]
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#define maxn 1000010#define inf 0x3f3f3f3f3f3fusing namespace std;typedef long long ll;ll n,m;int s[maxn];int dp[maxn];int pre[maxn];void init(){ memset(dp,0,sizeof(dp)); memset(pre,0,sizeof(pre));}int main(){ while(scanf("%I64d%64d",&m,&n)!=EOF) { init(); for(int i=1;i<=n;i++) scanf("%d",&s[i]); int tmp=-inf; for(int i=1;i<=m;i++) { tmp=-inf; for(int j=i;j<=n;j++) { dp[j]=max(dp[j-1],pre[j-1])+s[j]; pre[j-1]=tmp; tmp=max(dp[j],tmp); } } printf("%d\n",tmp); } return 0;}
- hdu 1024 dp滚动数组
- HDU 1024(DP+滚动数组)
- hdu 1513(dp+滚动数组)
- HDU 1024 Max Sum Plus Plus (DP·滚动数组)
- HDU - 1024 Max Sum Plus Plus(DP + 滚动数组)
- DP+滚动数组-HDU-1024-Max Sum Plus Plus
- HDU-1024-DP-(滚动数组优化与状态转移)
- HDU 1024 Max Sum Plus Plus DP+滚动数组
- HDU 1024 Max Sum Plus Plus【DP+滚动数组】
- hdu 2604 queue #DP#滚动数组
- HDU--1421 -- 搬寝室 [DP] [滚动数组]
- hdu 4576 Robot(dp+滚动数组)
- hdu 4576(概率dp+滚动数组)
- hdu 3392(滚动数组优化dp)
- hdu 4576 概率dp+滚动数组
- hdu 5230 整数划分+dp+滚动数组
- HDU 5389 Zero Escape(DP + 滚动数组)
- DP+滚动数组-HDU-1176-免费馅饼
- gulp相关命令及操作
- Android---多媒体(音乐播放器)
- 遇到项目无法清除 surefirebooter的jar包的解决方案
- hystrix学习笔记(二):工作原理简介
- Nvidia GPU架构演变
- HDU 1024(DP+滚动数组)
- RTTI机制(运行时类型识别)
- JAVA入门笔记01
- 请求和响应
- webview之独立进程
- SpringMVC启动过程详解
- 高精度乘法
- 筛选省市区的java项目
- linux打包指令,压缩指令学习