Max Sum Plus Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34600 Accepted Submission(s): 12359
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 32 6 -1 4 -2 3 -2 3
Sample Output
68
Hint
Huge input, scanf and dynamic programming is recommended.
Author
JGShining(极光炫影)
Recommend
题意:将一段序列分成m段,求最大m段和
状态转移:dp[j] = max(dp[ j-1 ]+a[ j ], Max[ j-1 ]+a[ j ]); 其中 dp[ j-1 ]+a[ j ] 代表把第 j 个数加到前一组里,Max[ j-1 ]+a[ j ]代表将第 j 个数单分一组。
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10, inf = 0x3f3f3f3f;
int n, m;
int a[N], dp[N], Max[N];
int main(){
while(scanf("%d%d", &m, &n) == 2){
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
memset(Max, 0, sizeof Max);
int maxi;
for(int i = 1; i <= m; i++){ //分成i组
maxi = -inf;
for(int j = i; j < n; j++){
dp[j] = max(dp[j-1]+a[j], Max[j-1]+a[j]);
Max[j-1] = maxi;
maxi = max(dp[j], maxi);
printf("%d ", dp[j]);
}
}
printf("%d\n", maxi);
}
}