HDU 1024 Max Sum Plus Plus
Max Sum Plus Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 51455 Accepted Submission(s): 18818
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.
完整代码
#include <iostream>
#include<cstdio>
#include<memory.h>
using namespace std;
const int maxn=1000005;
const int maxm=100;
const int inf=0x7ffffff;
int num[maxn];
int d[maxn];
int pre[maxn];
int main()
{
//freopen("in.txt","r",stdin);
int m,n,tmp;
while(cin>>m>>n){
int tmp;
for(int i=1;i<=n;++i){
cin>>num[i];
}
//dp[i][j],第j个人放在第i组时的最大值(1<=i<=j<=n,1<=i<=m)
memset(d,0,sizeof(d));
memset(pre,0,sizeof(pre));
for(int i=1;i<=m;++i){
tmp=-inf;
for(int j=i;j<=n;++j){
d[j]=max(d[j-1],pre[j-1])+num[j];
pre[j-1]=tmp;
tmp=max(tmp,d[j]);
}
}
cout<<tmp<<endl;
}
return 0;
}