Max Sum Plus Plus

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 1, S 2, S 3, S 4 ... 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 1, j 1) + sum(i 2, j 2) + sum(i 3, j 3) + ... + sum(i m, j m) maximal (i x ≤ iy ≤ 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 1, S2, S 3 ... S n. 
Process to the end of file. 

Output

Output the maximal summation described above in one line. 

Sample Input

题目大意：输入一个m，n分别表示成m组，一共有n个数即将n个数分成m组，m组的和加起来得到最大值并输出。

解题思路：状态dp[i][j]表示前j个数分成i组的最大值。 动态转移方程：dp[i][j]=max(dp[i][j-1]+a[j],max(dp[i-1][k])+a[j]) (0

 

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 <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1e6+10;
const int INF = 0x7fffffff;
int a[maxn];
int dp[maxn];
int Max[maxn];//max（dp[i-1][k]）就是上一组0~j-1的最大值
int main()
{
    int n,m,mmax;
    while(~scanf("%d%d",&m,&n))
    {
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&a[i]);
        }
        memset(dp,0,sizeof(dp));
        memset(Max,0,sizeof(Max));//分成0组的全是0
        for(int i = 1; i <= m; i++) //分成i组
        {
            mmax = -INF;
            for(int j = i; j <= n; j++) //前j个数分成i组，至少需要i个数
            {
                dp[j] = max(dp[j-1]+a[j],Max[j-1]+a[j]);
                //Max[j-1]目前代表的是分成i-1组前j-1个数的最大值,a[j]单独一组组成i组
                //dp[j-1]代表j-1个数分成组，第j个数a[j]放在前面i组的一组中，两种方式选取较大者
                Max[j-1] = mmax;//当前考虑的是j但是mmax是上一次循环得到的，所以更新的是j-1
                mmax = max(mmax,dp[j]);//更新mmax，这样下次循环同样更新的是j-1
            }
            //这样也就更新得到了分i组的Max，下次分i+1组的时候就可以使用了
        }
        printf("%d\n",mmax);
    }
    return 0;
}