#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int arr[maxn];
int dp[maxn][maxn], pre[maxn][maxn];
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> arr[i];
m = min(m, n);
memset(dp, 0x3f, sizeof(dp));
memset(pre, 0x3f, sizeof(pre));
dp[0][0] = 0;
for (int i = 0; i < n; i++) pre[i][0] = -arr[1] + 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i; j++) {
dp[i][j] = arr[i] + pre[i-1][j-1];
pre[i][j] = min(pre[i-1][j], dp[i][j] - arr[i+1] + 1);
}
cout << dp[n][m] << '\n';
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
solve();
return 0;
}
