#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAX_A = 5e3;
int solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (auto &a_i: a) {
cin >> a_i;
}
vector<vector<int>> dp(n + 1, vector<int>(MAX_A + 1, 3e5));
dp[0] = {0};
for (int i = 1; i <= n; ++i) {
for (int h = 0; h <= MAX_A; ++h) {
int prev = INT_MAX;
for (int j = max(h - m, 0); j <= MAX_A; ++j) {
prev = min(prev, dp[i - 1][j]);
}
dp[i][h] = (a[i - 1] != h) + prev;
}
}
cout << *min_element(dp[n].begin(), dp[n].end());
return 0;
}
#ifndef MY_UNIT_TEST
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
}
#endif
