#include<bits/stdc++.h>
#define ll long long
const int nmax = 3e5 + 5, N = 1e6;
const ll oo = 1e9 + 5, base = 311;
const int lg = 62, tx = 26;
const ll mod = 1e9 + 7;
#define pii pair<ll, ll>
#define fi first
#define se second
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' '; cout << "\n";
using namespace std;
int n, D;
int a[nmax];
namespace sub1{
int f[nmax];
void sol(){
int ans = 0;
for(int i = 1; i <= n; ++i) f[i] = 1;
for(int i = 1; i <= n; ++i){
int last = i;
for(int j = i; j >= 1; --j){
if(last - j > D) break;
if(a[i] > a[j]) f[i] = max(f[i], f[j] + 1);
if(a[i] >= a[j]) last = j;
}
ans = max(ans, f[i]);
}
cout << ans;
}
}
namespace sub2{
int d[nmax];
struct SG1{
int tree[nmax << 2];
void update(int id, int l, int r, int u, int val){
if(l > u || r < u) return;
if(l == r){
tree[id] = val;
return;
}
int mid = r + l >> 1;
update(id << 1, l, mid, u, val);
update(id << 1 | 1, mid + 1, r, u, val);
tree[id] = max(tree[id << 1], tree[id << 1 | 1]);
}
int get(int id, int l, int r, int u, int v){
if(u > v) return 0;
if(l >= u && r <= v) return tree[id];
int mid = r + l >> 1;
if(mid < u) return get(id << 1 | 1, mid + 1, r, u, v);
if(mid + 1 > v) return get(id << 1, l, mid, u, v);
return max(get(id << 1 | 1, mid + 1, r, u, v),get(id << 1, l, mid, u, v));
}
}one;
set<int> mt;
pii b[nmax];
int rev[nmax], f[nmax];
int r[nmax], mi[nmax];
int get(int u){
return r[u] ? r[u] = get(r[u]) : u;
}
vector<int> adj[nmax];
void Union(int u, int v){
u = get(u);v = get(v);
if(u != v){
r[u] = v;
mi[v] = min(mi[v], mi[u]);
}
}
void sol(){
for(int i = 1; i <= n; ++i){
b[i] = {a[i], i};
mi[i] = i;
adj[a[i]].push_back(i);
}
int ans = 1;
sort(b + 1, b + 1 + n, [](pii a, pii b){
if(a.fi == b.fi) return a.se > b.se;
return a.fi < b.fi;
});
int pos = 1;
mt.insert(-oo);
mt.insert(oo);
vector<pii> tmp;
for(int e = 1; e <= n; ++e){
for(auto i : adj[e]){
while(pos <= n && b[pos].fi <= e){
auto it = mt.lower_bound(b[pos].se);
int tx = *it;
if(abs(tx - b[pos].se) <= D) Union(tx, b[pos].se);
--it;
tx = *it;
if(abs(tx - b[pos].se) <= D) Union(tx, b[pos].se);
mt.insert(b[pos].se);
++pos;
}
auto it = mt.lower_bound(i);
--it;
int tx = *it;
int p = i;
if(abs(tx - i) <= D) p = mi[get(tx)];
int val = one.get(1, 1, n, p - D, i) + 1;
tmp.push_back({i, val});
}
for(auto [i, val] : tmp) one.update(1, 1, n, i, val);
tmp.clear();
}
cout << one.tree[1];
}
}
vector<int> nen;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// freopen("code.inp", "r", stdin);
// freopen("code.out", "w", stdout);
cin >> n >> D;
for(int i = 1; i <= n; ++i) cin >> a[i], nen.push_back(a[i]);
sort(nen.begin(), nen.end());
nen.erase(unique(nen.begin(), nen.end()), nen.end());
for(int i = 1; i <= n; ++i) a[i] = lower_bound(nen.begin(), nen.end(), a[i]) - nen.begin() + 1;
if(n <= 7000) sub1::sol();
else sub2::sol();
// sub2::sol();
}
/*
3 4
3 1
1 2
2 3
1 3
*/
