#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int inf = 1e9;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1), dp(n + 1, -inf);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[n] = max(dp[n], dp[i]);
for (int j = i + 1; j <= n; j++) {
if (a[j] <= a[i] + m * (j - i)) {
dp[j] = max(dp[j], dp[i] + 1);
}
}
}
cout << n - dp[n];
}
int main() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
int queries = 1;
#ifdef test_cases
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
cin >> queries;
#else
// cin >> queries;
#endif
for (int test_case = 1; test_case <= queries; test_case++) {
solve();
cout << '\n';
}
}
