HDU1024 Max Sum Plus Plus ——dp
来源:互联网 发布:股指期货模拟交易软件 编辑:程序博客网 时间:2024/05/19 00:16
Max Sum Plus Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30682 Accepted Submission(s): 10828
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. ^_^
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.
Process to the end of file.
Output
Output the maximal summation described above in one line.
Sample Input
1 3 1 2 32 6 -1 4 -2 3 -2 3
Sample Output
68HintHuge input, scanf and dynamic programming is recommended.
Author
JGShining(极光炫影)
题意:给一个数字序列,求其中的m段的和,使这个和最大。这m段互不相交。
分析:使用动态规划。dp[i][j]表示前j个数字中的i段最大和,并且它的最后一段是以a[j]结尾的。状态转移方程为:
dp[i][j] = max(dp[i][j-1]+a[j], dp[i-1][k]+a[j]),其中k的取值范围是:i-1<= k <=j-1
解释:1、dp[i][j-1]是前j-1个元素分成了i段,这个时候只需要将a[j]加在最后一段即可
2、dp[i-1][k]是前k个元素分成了i-1段,这个时候将a[j]这一个数作为第i段。
代码:
#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;#define N 1000005typedef long long ll;ll dp[2][N];ll a[N];int main(){int n, m;while(~scanf("%d", &m)){scanf("%d", &n);for(int i = 1; i <= n; i++)scanf("%lld", &a[i]);for(int i = 0; i <= n; i++)dp[0][i] = dp[1][i] = 0;int index = 0;for(int i = 1; i <= m; i++){dp[index][i] = dp[1-index][i-1] + a[i];ll M = dp[1-index][i-1];for(int j = i+1; j <= n-m+i; j++){M = max(M, dp[1-index][j-1]);dp[index][j] = max(dp[index][j-1], M) + a[j];}index = 1 - index;}index = 1 - index;ll ans = dp[index][m];for(int i = m+1; i <= n; i++)ans = max(ans, dp[index][i]);printf("%lld\n", ans);}return 0;}注意代码中的优化,如果k值每次都从i-1到j-1遍历一遍的话,会超时。
因此用一个M表示dp[i-1][i-1]到dp[i-1][j-1]的最大值,j每次+1时都更新M为从i-1到j-1的最大值。
阅读全文
0 0
- HDU1024——Max Sum Plus Plus(DP)
- HDU1024——Max Sum Plus Plus(dp)
- HDU1024 Max Sum Plus Plus ——dp
- HDU1024 Max Sum Plus Plus 【DP】
- HDU1024 Max Sum Plus Plus(DP)
- hdu1024--Max Sum Plus Plus(dp)
- hdu1024 Max Sum Plus Plus--DP
- HDU1024 Max Sum Plus Plus //DP
- hdu1024 Max Sum Plus Plus dp
- HDU1024-Max Sum Plus Plus(dp)
- 【HDU1024】Max Sum Plus Plus(dp)
- HDU1024 ——Max Sum Plus Plus(动态规划)
- hdu1024-Max Sum Plus Plus
- hdu1024 Max Sum Plus Plus
- HDU1024 Max Sum Plus Plus
- HDU1024--Max Sum Plus Plus
- HDU1024 Max Sum Plus Plus
- hdu1024 Max Sum Plus Plus
- HDU 6105 Gameia [想法题]
- css中的margin、padding、border详解
- poj 1458 小白算法练习 Common Subsequence 动态规划
- HDU 6106 Classes -逻辑题-2017多效联盟6 第11题
- 静态代码块,构造代码块,普通代码块-三者的执行顺序及区别
- HDU1024 Max Sum Plus Plus ——dp
- 快速生成文档注释快捷键
- 高德地图api的自定义地点标注
- 2107-图的深度遍历
- 将tomcat注册为服务
- 用户画像的入门(转自CDC)
- hdu 1686 Oulipo (KMP裸题)
- 接口测试—-工具篇,实现接口自动化
- K