#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin>>N>>M;
long long pillars[N+1];
memset(pillars,0,sizeof(pillars));
int ans = 0;
for(int i = 0;i<=N;i++){
int x;
cin>>x;
pillars[i] = x-M*(i);
}
vector<long long>dp(N+1,-1e15);
dp[0] = 1e15;
for (int i = 0; i < N; i++) {
int l = upper_bound(dp.begin(), dp.end(), pillars[i],greater<long long>()) - dp.begin();
if(l==1&&pillars[i]>1LL*M*(i+1)){
continue;
}
if (dp[l-1] >= pillars[i] && pillars[i] >= dp[l])
dp[l] = pillars[i];
}
for (int l = 0; l <= N; l++) {
if (dp[l] > -1e15)
ans = l;
}
cout<<N-ans;
}
