具体代码如下
#include<iostream>
#include<cstring>
using namespace std;
const int N = 100010, M = 110, INF = 0x3f3f3f3f;
int n, m;
int f[N][M][2];
int a[N];
int main(){
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++ i) scanf("%d", &a[i]);
memset(f, -0x3f, sizeof f);
for(int i = 0; i <= n; ++ i) f[i][0][0] = 0;
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= m; ++ j){
f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1] + a[i]);
f[i][j][1] = max(f[i - 1][j - 1][0] - a[i], f[i - 1][j][1]);
}
int res = 0;
for(int i = 0; i <= m; ++ i) res = max(res, f[n][i][0]);
printf("%d\n", res);
return 0;
}