#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
ll a[mx];
set<ll> v;
vi vv;
ll dp[mx];
typedef struct SEGMENT_TREE{
vi arr,st,en;
ll range;
void init(ll k){
range = log2(k);
range = 1 << (range + 3);
arr.resize(range,-1e18);
st.resize(range);
en.resize(range);
return;
}
ll construct(ll ptr,ll l,ll r){
if(l==r){
arr[ptr] = -1e18;
st[ptr] = vv[l];
en[ptr] = vv[l];
return arr[ptr];
}
ll mid = l + (r-l)/2;
arr[ptr] = max(construct(2*ptr,l,mid),construct(2*ptr+1,mid+1,r));
st[ptr] = st[2*ptr];
en[ptr] = en[2*ptr+1];
return arr[ptr];
}
ll update(ll ptr,ll l,ll r,ll val,ll pos){
if(l==r && st[ptr]==pos){
arr[ptr] = val;
return arr[ptr];
}
if(st[ptr]>pos || en[ptr]<pos)
return arr[ptr];
ll mid = l + (r-l) / 2;
arr[ptr] = max(update(2*ptr,l,mid,val,pos),update(2*ptr+1,mid+1,r,val,pos));
return arr[ptr];
}
ll query(ll ptr,ll l,ll r,ll u,ll v){
if(st[ptr] > v || en[ptr] < u)
return -1e18;
if(st[ptr] >= u && en[ptr] <= v)
return arr[ptr];
ll mid = l + (r-l)/2;
return max(query(2*ptr,l,mid,u,v),query(2*ptr+1,mid+1,r,u,v));
}
void deb(ll ptr,ll l,ll r){
cerr<<l<<" "<<r<<nli;
cerr<<st[ptr]<<" "<<arr[ptr]<<" "<<en[ptr]<<nli;
if(l==r)
return;
ll mid = l + (r-l)/2;
deb(2*ptr,l,mid);
deb(2*ptr+1,mid+1,r);
return;
}
}SGT;
SGT sgt;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
cin>>n>>m;
v.insert(0);
fip(1,n+1){
cin>>a[i];
v.insert(a[i]);
}
tp = *v.begin();
tp2 = *v.rbegin();
fx(v)
vv.push_back(x);
tptp = v.size();
sgt.init(tptp);
sgt.construct(1,0,tptp-1);
dp[0] = 0;
sgt.update(1,0,tptp-1,0,0);
// sgt.deb(1,0,tptp-1);
fip(1,n+1){
dp[i] = 1 + sgt.query(1,0,tptp-1,a[i]-m,tp2);
sgt.update(1,0,tptp-1,dp[i],a[i]);
}
ans = 1e18;
fip(0,n+1)
ans = min(ans,n-dp[i]);
cout<<ans<<nli;
cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
