hdu1024 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): 28136    Accepted Submission(s): 9810

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 S₁, S₂, S₃, S₄ ... S_x, ... S_n (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ S_x ≤ 32767). We define a function sum(i, j) = S_i + ... + S_j (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(i₁, j₁) + sum(i₂, j₂) + sum(i₃, j₃) + ... + sum(i_m, j_m) maximal (i_x ≤ i_y ≤ j_x or i_x ≤ j_y ≤ j_x 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(i_x, j_x)(1 ≤ x ≤ m) instead. ^_^

 

Input

Each test case will begin with two integers m and n, followed by n integers S₁, S₂, S₃ ... S_n.
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（极光炫影）

 

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N=1e6+;
int n,m,a[N];
//int f[N][N];
int f[N],maxn[N];
int main(){
    while(~scanf("%d%d",&m,&n)){
        memset(f,,sizeof f);
        memset(maxn,,sizeof maxn);
        for(int i=;i<=n;i++) scanf("%d",a+i);
        /*for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                f[i][j]=f[i-1][j]+a[i];
                for(int k=1;k<i;k++){
                    f[i][j]=max(f[i][j],f[k][j-1]+a[i]);
                }
            }
        }
        printf("%d\n",f[n][m]);*/
        int nowans=;
        for(int j=;j<=m;j++){
            nowans=-1e9;
            for(int i=j;i<=n;i++){
                f[i]=max(f[i-],maxn[i-])+a[i];
                maxn[i-]=nowans;
                nowans=max(nowans,f[i]);
            }
        }
        printf("%d\n",nowans);
    }
    return ;
}