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
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. 题目大意:n为你要找的几个子序列的和,m为序列一共有几个数,让你求找n个子序列的和最大。
思路:参考博客:https://blog.csdn.net/pmt123456/article/details/52695470
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[1000010];
int pre[1000010];
int a[1000010];
int main()
{
int m,n;
while(~scanf("%d%d",&m,&n))
{
memset(a,0,sizeof(a));
memset(pre,0,sizeof(pre));
memset(dp,0,sizeof(dp));
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
int maxx;
for(int i=1; i<=m; i++)
{
maxx=-0x3f3f3f3f;
for(int j=i; j<=n; j++)
{
dp[j]=max(dp[j-1],pre[j-1])+a[j];
pre[j-1]=maxx;
maxx=max(maxx,dp[j]);
}
}
printf("%d\n",maxx);
}
return 0;
}