#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 2e5 + 69;
const int INF = 1e9 + 69;
int dp[N];
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, d; cin >> n >> d;
vector<int> a(n+2);
for(int i= 1; i<=n; ++i) cin >> a[i];
for(int i= 1; i<=n+1; ++i) a[i] -= i * d;
vector<int> st(n + 2, -INF); st[0] = INF * 2;
int ans = 0;
for(int i = 0; i<=n; ++i){
if (a[i] > 0) continue;
int idx = upper_bound(ALL(st), a[i], greater<int>()) - st.begin();
maximize(st[idx], a[i]);
maximize(ans, idx);
}
cout << n - ans + 1<< "\n";
return 0;
}
