#include<bits/stdc++.h>
typedef int ii;
typedef long long ll;
using namespace std;
const string name = "";
const ii MOD = 1e9 + 7;
const ii N = 3e5 + 10;
ii n, d;
ii a[N];
vector<pair<ii, ii>> v;
void INP(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
if (fopen((name + ".inp").c_str(),"r")){
freopen((name + ".inp").c_str(),"r",stdin);
freopen((name + ".out").c_str(),"w",stdout);
}
cin >> n >> d;
for (ii i = 1;i <= n;i++){
cin >> a[i];
v.push_back({a[i], i});
}
}
bool cmp(const pair<ii, ii> a,const pair<ii, ii> b){
if (a.first != b.first) return a.first < b.first;
return a.second > b.second;
}
ii par[N], dp[N], res[N];
void init(){
for (ii i = 1;i <= n;i++) par[i] = i;
}
ii find_par(ii u){
return (u == par[u] ? u : par[u] = find_par(par[u]));
}
void connect(ii u, ii v){
res[v] = max(res[v], dp[u]);
}
ii st[4 * N];
void update(ii id, ii l, ii r, ii pos){
if (l > pos || pos > r) return;
if (l == r){
st[id] = 1;
return;
}
update(id * 2, l, (l + r) / 2, pos);
update(id * 2 + 1, (l + r) / 2 + 1, r, pos);
st[id] = max(st[id * 2], st[id * 2 + 1]);
}
ii find_res(ii id, ii l, ii r, ii u, ii v){
if (u > r || l > v) return 0;
if (l == r){
if (st[id] == 1) return l;
return 0;
}
if (u <= l && r <= v){
if (st[id * 2 + 1] == 1){
return find_res(id * 2 + 1, (l + r) / 2 + 1, r, u, v);
}
if (st[id * 2] == 1){
return find_res(id * 2, l, (l + r) / 2, u, v);
}
return 0;
}
return max(find_res(id * 2, l, (l + r) / 2, u, v), find_res(id * 2 + 1, (l + r) / 2 + 1, r, u, v));
}
int main(){
INP();
sort(v.begin(), v.end(), cmp);
init();
ii nxt, SOL = 1;
for (auto x : v){
update(1, 1, n, x.second);
if (x.second == 1){
dp[1] = 1;
nxt = 0;
}
else{
nxt = find_res(1, 1, n, max(1, x.second - d), x.second - 1);
connect(nxt, x.second);
dp[x.second] = res[x.second] + 1;
}
SOL = max(SOL, dp[x.second]);
}
cout << SOL;
return 0;
}
//NGT 1600-2000 cf
//1/200 hard quests
