#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <iostream>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int32_t main(){
int n, k;
cin>>n>>k;
vector<int> vect(n), lis(1, 0);
for (int i=0; i<n; ++i)cin>>vect[i], vect[i]=i*k+k-vect[i];
for (int i=0; i<n; ++i){
if (vect[i]<0)continue;
if (vect[i]>=lis.back())lis.pb(vect[i]);
else *upper_bound(lis.begin(), lis.end(), vect[i])=vect[i];
}
cout<<n-lis.size()+1;
}
