#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>   
using namespace std;
using namespace __gnu_pbds;
typedef long long ll; 
#define int long long
typedef unsigned long long lu;
typedef vector<ll> v;
typedef vector<vector<ll> > vv;
typedef vector<string>  vs;
typedef vector<pair<ll,ll>> vpr;
typedef vector<bool>vb;
typedef vector<double>vd;
typedef long double ld;
#define f(i,n) for(ll i = 0; i < n; i++)
#define ff(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define endl "\n"
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define amax(x,y) if(y>x) x=y;
#define amin(x,y) if(y<x)x=y;
#define bg(x) x.begin()
#define sz(x) (ll)x.size()
#define in(x,n) for(ll i=0;i<n;i++)cin>>x[i]
#define out(x,n) for(ll i=0;i<n;i++)cout<<x[i]<<" " 
#define mxt(a) *(max_element(a.begin(),a.end()))
#define mnt(a) *(min_element(a.begin(),a.end())
#define tc ll t;cin>>t;while(t--)
typedef pair<ll,ll> pi;
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yesno(f) if(f) yes else no
const v dx = {1, -1, 0, 0};
const v dy = {0, 0, 1, -1};
const ld PI = 2 * acos(0.0);
ll cel(ll x1,ll y1){if((x1%y1)==0)return x1/y1;else return x1/y1+1;}
ll power(ll a,ll b,ll m)
{
    if(b==0)
        return 1;
    ll d=power(a,b/2,m);
    d=(d*d)%m;
    if(b&1)
        d=(d*a)%m;
    return d;
}
const ll mod=1e9+7;
int MOD(int a)
{
    if(a<0)
        a+=mod;
    if(a>=mod)
        a%=mod;
    return a;
}
// set_name.find_by_order(k) It returns to an iterator to the kth element (counting from zero) in the set in O(logn) time
// set_name.order_of_key(k) It returns to the number of items that are strictly smaller than our item k in O(logn) time.
/*string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
str.substr (x) : returns a substring str[x],... end of string
str.find(qtr) : returns the first occurenece of qtr in str */
vector<ll>seg;
#define ZERO 0
void merge(const int &a,const int &b,int &c)
{
    c=max(a,b);
}
void build(ll pos,ll ss,ll se)
{
    if(pos==0)
        seg.resize(4*(se+1)+1);
    if(ss==se)
    {
        seg[pos]=0;
        return;
    }
    ll mid=(ss+se)/2;
    build(2*pos+1,ss,mid);
    build(2*pos+2,mid+1,se);
    merge(seg[2*pos+1],seg[2*pos+2],seg[pos]);
}
ll query(ll pos,ll ss,ll se,ll l,ll r)
{
    if(l>se || r  < ss)
        return ZERO;
    if(ss >=l && se<=r)
        return seg[pos];
    ll mid=(ss+se)/2;
    ll q1=query(2*pos+1,ss,mid,l,r);
    ll q2=query(2*pos+2,mid+1,se,l,r);
    ll ans;merge(q1,q2,ans);
    return ans;
}
void update(ll pos,ll ss,ll se,ll index,ll value)
{
    if(index <ss || index >se)
        return ;
    if(ss==se)
    {
        seg[pos]=value;
        return ;
    }
    ll mid=(ss+se)/2;
    update(2*pos+1,ss,mid,index,value);
    update(2*pos+2,mid+1,se,index,value);
    merge(seg[2*pos+1],seg[2*pos+2],seg[pos]);
}


int32_t main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int n,k;cin>>n>>k;
    v a(n);
    for(int i=0;i<n;i++)
    {
    	cin>>a[i];
    }
    const int N=3e5+1;
    build(0,0,N-1);
    int fans=0;
    for(int i=n-1;i>=0;i--)
    {
    	int l=max(0ll,a[i]-k);
    	int r=min(N-1,a[i]+k);
    	int ans=query(0,0,N-1,l,r)+1;
    	fans=max(fans,ans);
    	update(0,0,N-1,a[i],ans);
    }
    cout<<fans<<endl;
    return 0;
}

Measured memory_bytes: 15080