#include <iostream>
#include <algorithm>
#include <set>
#define pii pair<int, int>
#define fst first
#define snd second
using namespace std;
const int SZ = (1 << 20) + 5;
int N, D;
int DP[300001], seg[SZ];
pii A[300001];
set<pii> S;
void upd(int idx, int L, int R, int x, int v)
{
if (L == R) {seg[idx] = v;}
else if (L < R)
{
int M = L + R >> 1;
if (x <= M) upd(2 * idx, L, M, x, v);
else upd(2 * idx + 1, M + 1, R, x, v);
seg[idx] = max(seg[2 * idx], seg[2 * idx + 1]);
}
}
int qry(int idx, int L, int R, int l, int r)
{
l = max(L, l); r = min(R, r);
if (l <= r)
{
if (L == l && R == r) return seg[idx];
else
{
int M = L + R >> 1;
return max(qry(2 * idx, L, M, l, r), qry(2 * idx + 1, M + 1, R, l, r));
}
}
return 0;
}
void delet(int x)
{
auto it = S.lower_bound({x + 1, -1});
if (it != S.begin())
{
it = prev(it);
if (it -> fst <= x && x <= it -> snd)
{
pii r = *it; S.erase(it);
if (x - r.fst >= D) S.insert({r.fst, x - 1});
if (r.snd - x >= D) S.insert({x + 1, r.snd});
}
}
}
int main()
{
ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N >> D;
for (int i = 0; i < N; i++)
{
cin >> A[i].fst; A[i].snd = -(i + 1);
}
sort(A, A + N);
int res = 0;
S.insert({1, N});
for (int i = 0; i < N; i++)
{
//cerr << "i: " << i << "\n";
int id = -A[i].snd;
delet(id);
//cerr << "id: " << id << "\n";
int l; auto it = S.upper_bound({id, -1});
if (it != S.begin()) {l = prev(it) -> snd + 1;}
else {l = 1;}
//cerr << "l: " << l << "\n";
DP[id] = qry(1, 1, N, l, id) + 1;
upd(1, 1, N, id, DP[id]);
res = max(res, DP[id]);
}
cout << res << "\n";
return 0;
}
