Max Sum Plus Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7919 Accepted Submission(s): 2624
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 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 ≤ 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. ^_^
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 ≤ 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
1, S
2, S
3 ... S
n.
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 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 <stdlib.h>
#include <stdio.h>
int f[1000003];
int best[2][1000003];
int N, M; //m组 n个数字
int a[1000003];
int sum[1000003];
int max(int,int);
int main() {
while (scanf("%d %d", &M, &N) != EOF) {
int ans = -2000000000;
int i,j;
sum[0] = 0;
for (i = 1; i <= N; i++) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i]; //sum[i]式从0到i a[0] + ...a[i]
}
for (i = 0; i <= N; i++) best[0][i] = 0;
int cur = 0;
for (j = 1; j <= M; j++) {
for (i = 0; i <= j - 1; i++) best[1 - cur][i] = -2000000000;
for (i = j; i <= N; i++) {
if (j == i) f[i] = sum[i]; //i是数组,j式分段数,如果i==j那么一定是总数的和
else f[i] = max( best[cur][i - 1], f[i - 1] ) + a[i];//f[i]表示在分j段、i个数的情况下,最大值。 best[cur][i-1] 表示j-1段 i-1个数的最大值,然后把a[i]单独当成第j段,f[-1]表示j段 i-1个数的最大值,加上a[i]表示没有把a[i]
//当成第j段,而是第j段中的一个
best[1 - cur][i] = max(best[1 - cur][i - 1], f[i]);//best[1-cur][i]表示 分成j段 i个数的最大值
if (j == M) ans = max(ans, f[i]);
}
cur = 1 - cur;
}
printf("%d\n", ans);
}
return 0;
}
int max(int a,int b)
{
return (a>b)?a:b;
}
#include <stdio.h>
int f[1000003];
int best[2][1000003];
int N, M; //m组 n个数字
int a[1000003];
int sum[1000003];
int max(int,int);
int main() {
while (scanf("%d %d", &M, &N) != EOF) {
int ans = -2000000000;
int i,j;
sum[0] = 0;
for (i = 1; i <= N; i++) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i]; //sum[i]式从0到i a[0] + ...a[i]
}
for (i = 0; i <= N; i++) best[0][i] = 0;
int cur = 0;
for (j = 1; j <= M; j++) {
for (i = 0; i <= j - 1; i++) best[1 - cur][i] = -2000000000;
for (i = j; i <= N; i++) {
if (j == i) f[i] = sum[i]; //i是数组,j式分段数,如果i==j那么一定是总数的和
else f[i] = max( best[cur][i - 1], f[i - 1] ) + a[i];//f[i]表示在分j段、i个数的情况下,最大值。 best[cur][i-1] 表示j-1段 i-1个数的最大值,然后把a[i]单独当成第j段,f[-1]表示j段 i-1个数的最大值,加上a[i]表示没有把a[i]
//当成第j段,而是第j段中的一个
best[1 - cur][i] = max(best[1 - cur][i - 1], f[i]);//best[1-cur][i]表示 分成j段 i个数的最大值
if (j == M) ans = max(ans, f[i]);
}
cur = 1 - cur;
}
printf("%d\n", ans);
}
return 0;
}
int max(int a,int b)
{
return (a>b)?a:b;
}
注释:
1.代码是别人的,我只是花了不少时间去理解他;在这个感谢写这段代码的人;
2.各个变量的含义:
f[ i]代表的循环内,就是分成J(:1->m)段的情况下,共有i个数 最优值,
best[0][i] best[1][i] 代表的是 加入0代表有j段,那么1代表j+1段,best[0][i]表示在有j个不交叉段 i个数字的情况下,最优值
a[]储存输入数组
sum[i] 表示前i个数的和
for (i = 1; i <= N; i++) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i]; //sum[i]式从0到i a[0] + ...a[i]
}
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i]; //sum[i]式从0到i a[0] + ...a[i]
}
表示初始化sum[i],sum[i] = a[0]+a[1]+...a[i]
***********************************************************忧愁的分割线***************************************
for (i = 0; i <= N; i++) best[0][i] = 0;
表示初始化best[0][]
************************************************************************忧愁的分割线************************************************************************
for (j = 1; j <= M; j++) {
for (i = 0; i <= j - 1; i++) best[1 - cur][i] = -2000000000;
for (i = j; i <= N; i++) {
if (j == i) f[i] = sum[i];
else f[i] = max( best[cur][i - 1], f[i - 1] ) + a[i];
best[1 - cur][i] = max(best[1 - cur][i - 1], f[i]);
if (j == M) ans = max(ans, f[i]);
}
cur = 1 - cur;
}
for (i = 0; i <= j - 1; i++) best[1 - cur][i] = -2000000000;
for (i = j; i <= N; i++) {
if (j == i) f[i] = sum[i];
else f[i] = max( best[cur][i - 1], f[i - 1] ) + a[i];
best[1 - cur][i] = max(best[1 - cur][i - 1], f[i]);
if (j == M) ans = max(ans, f[i]);
}
cur = 1 - cur;
}
本程序的核心代码:
1.if (j == i) f[i] = sum[i]; 如果输入的数字跟分的段数一样多,那肯定一个一组了
2.f[i] = max( best[cur][i - 1], f[i - 1] ) + a[i];
这一句最难理解,a[i] 要么独立分成一个组,就是第j组,要么第j组里不仅有a[i],而且还有其他的数,best[cur][i-1] 代表的是j-1段,i-1个数字,此时的最优值,而f[i-1]表示的是j段,i-1个数字 的最优值,注意best[cur][i-1]和best[1-cur][i-1]的区别,后者是j段,前者是j-1段,f[i-1]也是j段。
3.best[1 - cur][i] = max(best[1 - cur][i - 1], f[i]);主要是生成j段的情况下,i(j<=i<=n)是的最优值,是一个一维数组