0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 18:31:59 +00:00

P2389 电脑班的裁员

R72132358
This commit is contained in:
Baoshuo Ren 2022-03-23 14:34:15 +08:00
parent ab566c92ab
commit 34b2099b3e
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

33
Luogu/P2389/P2389.cpp Normal file
View File

@ -0,0 +1,33 @@
#include <algorithm>
#include <iostream>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 505;
int n, k, sum[N], f[N][N];
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
sum[i] = sum[i - 1] + x;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
for (int l = j - 1; l <= i; l++) {
f[i][j] = std::max({f[i][j], f[i - 1][j], f[l][j - 1] + (sum[i] - sum[l])});
}
}
}
cout << f[n][k] << endl;
return 0;
}