#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 500010;
int n, d;
int a[N], f[N];
struct Node
{
int l, r;
int v;
}tr[N * 4];
void build(int u, int l, int r)
{
if(l == r) tr[u] = {l, r, 0};
else
{
tr[u] = {l, r};
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}
}
void pushup(int u)
{
tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v);
}
void modify(int u, int x, int c)
{
if(tr[u].l == x && tr[u].r == x)
{
tr[u].v = c;
}
else
{
int mid = tr[u].l + tr[u].r >> 1;
if(x <= mid) modify(u << 1, x, c);
else modify(u << 1 | 1, x, c);
pushup(u);
}
}
int query(int u, int l, int r)
{
if(tr[u].l >= l && tr[u].r <= r) return tr[u].v;
else
{
int v = 0;
int mid = tr[u].l + tr[u].r >> 1;
if(r <= mid) return query(u << 1, l, r);
else if(l > mid) return query(u << 1 | 1, l, r);
else
{
v = query(u << 1, l, r);
v = max(v, query(u << 1 | 1, l, r));
}
return v;
}
}
int main()
{
cin >> n >> d;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
build(1, 1, N);
for (int i = 1; i <= n; i ++ )
{
f[i] = 1;
int l = max(0, a[i] - d);
int r = a[i] + d;
int t = query(1, l, r);
// cout << l << ' ' << r << ' ' << t << endl;
int zzz = t + 1;
f[i] = max(f[i], zzz);
// cout << f[a[i]] << endl;
modify(1, a[i], f[i]);
}
// for (int i = 1; i <= n; i ++ ) cout << f[a[i]] << ' ';
int ans = 0;
for (int i = 1; i <= n; i ++ ) ans = max(ans, f[i]);
cout << ans << endl;
return 0;
}