#include <bits/stdc++.h>
#define se second
#define fs first
#define pb push_back
#define ll long long
#define ii pair<ll,ll>
#define ld long double
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define bit(msk, i) ((msk >> i) & 1)
#define iter(id, v) for(auto id : v)
#define rep(i,m,n) for(int i=(m); i<=(n); i++)
#define reb(i,m,n) for(int i=(m); i>=(n); i--)
using namespace std;
mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }
const int N = 3e5 + 7;
const ll Mod = 1e9 + 7;
const int szBL = 916;
const int INF = 2e9 + 7;
const int BASE = 137;
int n, D;
int a[N], BoundR[N];
pair<int,int> b[N];
int dp[N];
struct Segment_tree {
int Range;
int Right[N << 2], Left[N << 2];
int st[N << 2], lz[N << 2];
bool pass[N << 2]; /// go to the leftmost
void init (int n) {
Range = n;
}
void update_Occ (int id, int l, int r, int pos, int val) {
if (l > pos || r < pos) return;
if (l == r) {
Left[id] = pos;
Right[id] = pos;
pass[id] = 1;
return;
}
int mid = l + r >> 1;
update_Occ (id << 1, l, mid, pos, val);
update_Occ (id << 1 | 1, mid + 1, r, pos, val);
if (pass[id << 1 | 1] && pass[id << 1] && Left[id << 1 | 1] - Right[id << 1] <= D) pass[id] = 1;
else pass[id] = 0;
Left[id] = Left[id << 1];
Right[id] = Right[id << 1 | 1];
}
void down (int id) {
rep (i, id << 1, id << 1 | 1) {
lz[i] = max(lz[id], lz[i]);
st[i] = max(lz[id], st[i]);
}
lz[id] = 0;
}
void update_Val (int id, int l, int r, int u, int v, int val) {
if (l > v || r < u) return;
if (l >= u && r <= v) {
st[id] = max(st[id], val);
lz[id] = max(lz[id], val);
return;
}
int mid = l + r >> 1;
down(id);
update_Val (id << 1, l, mid, u, v, val);
update_Val (id << 1 | 1, mid + 1, r, u, v, val);
st[id] = max(st[id << 1], st[id << 1 | 1]);
}
int get_Val (int id, int l, int r, int pos) {
if (l > pos || r < pos) return 0;
if (l == r) return st[id];
int mid = l + r >> 1;
down(id);
return max (get_Val(id << 1, l, mid, pos),
get_Val (id << 1 | 1 , mid + 1, r, pos) );
}
int get_Bound (int id, int l, int r, int u, int v) {
if (l > v || r < u) return 1;
if (l >= u && r <= v) return pass[id];
int mid = l + r >> 1;
return min (get_Bound (id << 1, l, mid, u, v),
get_Bound (id << 1 | 1 , mid + 1, r, u, v) );
}
void update_Occ (int pos, int val) {
update_Occ (1, 1, Range, pos, val);
}
void update_Val (int u, int v, int val) {
update_Val (1, 1, Range, u, v, val);
}
int get_Bound (int u, int v) {
return get_Bound (1, 1, Range, u, v);
}
int get_Val (int pos) {
return get_Val (1, 1, Range, pos);
}
}ST;
int get_Bound (int pos) {
int lf = pos, rt = n;
while (lf < rt) {
int mid = lf + rt + 1 >> 1;
if (ST.get_Bound(pos, mid)) lf = mid;
else rt = mid - 1;
}
return rt;
}
void solution () {
cin >> n >> D;
rep (i, 1, n) cin >> a[i];
rep (i, 1, n) b[i] = {a[i], i};
sort (b + 1, b + 1 + n);
ST.init(n);
rep (i, 1, n) {
int pos = b[i].se;
dp[pos] = ST.get_Val (pos);
BoundR[pos] = min(n, get_Bound (pos) + D);
ST.update_Val (pos, BoundR[pos], dp[pos]);
if (b[i].fs != b[i + 1].fs) {
int neo = i;
while (neo > 1 && b[neo].fs == b[neo - 1].fs) --neo;
rep (j, neo, i) {
int pos = b[j].se;
dp[pos]++;
ST.update_Val (pos, BoundR[pos], dp[pos]);
}
}
}
int res = dp[n];
rep (i, 1, n) if (a[i] >= a[n]) res = max(res, dp[i]);
cout << res <<"\n";
}
#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
int main () {
// file("c");
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll num_Test = 1;
// cin >> num_Test;
while(num_Test--)
solution();
}
/*
7 1
100 600 600 200 300 500 500
*/
