You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
32 lines
997 B
32 lines
997 B
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
const int INF = 0x3f3f3f3f;
|
|
const int N = 1e5 + 10, M = 110;
|
|
|
|
int n, k;
|
|
int w[N];
|
|
int f[N][M][2];
|
|
// 以卖出做为一次完整交易的分界线
|
|
// f[i][j][0/1]定义成 前i天 完成最多是j次交易 且 决策为0/1的集合
|
|
int main() {
|
|
cin >> n >> k;
|
|
for (int i = 1; i <= n; i++) cin >> w[i];
|
|
|
|
memset(f, -0x3f, sizeof f);
|
|
|
|
for (int i = 0; i <= n; i++) f[i][0][0] = 0;
|
|
for (int j = 0; j <= n; j++) f[0][j][0] = 0;
|
|
|
|
// 下面两句，由于整体进行了初始化，就变得可以省略了
|
|
// for (int i = 0; i <= n; i++) f[i][0][1] = -INF;
|
|
// for (int j = 0; j <= n; j++) f[0][j][1] = -INF;
|
|
|
|
for (int i = 1; i <= n; i++) {
|
|
for (int j = 0; j <= k; j++) {
|
|
if (j) f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j - 1][1] + w[i]);
|
|
f[i][j][1] = max(f[i - 1][j][1], f[i - 1][j][0] - w[i]);
|
|
}
|
|
}
|
|
cout << f[n][k][0] << endl;
|
|
return 0;
|
|
} |