#include<bits/stdc++.h>
#include<queue>
using namespace std;

#define what_is(x) cout << #x << " is " << x << endl;
#define PI acos(-1)
#define hell 1000000007
#define HELL 998244353
#define io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define fix(n) cout << fixed << setprecision(n)
#define mset(a,n) memset(a,n,sizeof a)
#define rep(i,a,b) for (__typeof((b)) i=(a);i<(b);i++)
#define repp(i,a,b,p) for(__typeof((b)) i=(a);i<(b);i+=p)
#define ren(i,a,b) for(__typeof((a)) i=(a);i>=(b);i--)
#define renn(i,a,b,p) for(__typeof((a) i=(a);i>=(b);i-=p)
#define ADD(a,b,c) ((a)%c+(b)%c)%c
#define SUB(a,b,c) ((a)%c-(b)%c+c)%c
#define MUL(a,b,c) (((a)%c)*((b)%c))%c
#define lbd lower_bound
#define ubd upper_bound
#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define all(v) (v).begin(), (v).end()
#define sz(x) (ll)x.size()
// #define out(n) cout<<n<<" "
#define outl(n) cout<<n<<endl
#define bug(n) {outl(n);return;}
#define pii pair<int,int>
#define lim 9223372036854775806
#define ninf -9223372036854775802
#define M 998244353  
#define eps 1e-9
#define MAX 2
#define N 300002
#define db(a) for(auto it:a) {cout<<it<<" ";}cout<<endl;
ll prime[MAX];
ll fact[MAX];

const long long INF64 = 1e18;
ll vpow(ll a, ll b, ll p) {
    if (b == 0)
        return 1;
    if (b == 1)
        return a;
    ll temp = vpow(a, b / 2, p);
    temp *= temp;
    temp %= p;
    if (b % 2 == 0)
        return temp;
    temp = temp * a;
    temp %= p;
    return temp;
}

ll gcd(ll a, ll b) {
    if (a == 0)
        return b;
    return gcd(b % a, a);
}


ll inverseMod(ll a, ll b, ll p) {
    if (b == 0)
        return 1;
    ll temp = vpow(b, p - 2, p);
    ll ans = temp * a;
    ans %= p;
    return ans;
}
void sieve()
{
    prime[0] = prime[1] = 1;
    for (ll i = 2; i < MAX; i++) {
        if (prime[i] == 0) {
            for (int j = i * 2; j < MAX; j += i) {
                if (prime[j] == 0) {
                    prime[j] = i;
                }
            }
            prime[i] = i;
        }
    }
}


void factorial() {
    fact[0] = 1;
    fact[1] = 1;
    rep(i, 2, MAX) {
        fact[i] = (fact[i - 1] * i);
         fact[i]%=M;
    }
}
void dfs(vector<ll> adj[],ll u,vector<bool> &vis){
    vis[u]=true;
    //cout<<"IN "<<u<<endl;
    for(auto ch:adj[u]){
        if(!vis[ch])
            dfs(adj,ch,vis);
    }
}
ll seg[4*N],lazy[4*N];
void update(ll ind,ll left,ll right,ll l,ll r,ll val){
    if(left> right || r<left || right<l)
        return ;
    if(lazy[ind]!=0){
        seg[ind]=max(seg[ind],lazy[ind]);
        if(left!=right){
            lazy[2*ind]=max(lazy[2*ind],lazy[ind]);
            lazy[2*ind+1]=max(lazy[2*ind+1],lazy[ind]);
        }
        lazy[ind]=0;
    }
    if(l<=left && right<=r){
        seg[ind]=max(seg[ind],val);
        if(left!=right){
            lazy[2*ind]=max(lazy[2*ind],val);
            lazy[2*ind+1]=max(lazy[2*ind+1],val);
        }
        return ;
    }
    ll mid=left+(right-left)/2;
    update(2*ind,left,mid,l,r,val);
    update(2*ind+1,mid+1,right,l,r,val);
    seg[ind]=max(seg[2*ind],seg[2*ind+1]);
    return ;
}


ll get(ll ind,ll left,ll right,ll l,ll r){
    if(left> right || r<left || right<l)
        return INT_MIN;
    if(lazy[ind]!=0){
        seg[ind]=max(seg[ind],lazy[ind]);
        if(left!=right){
            lazy[2*ind]=max(lazy[2*ind],lazy[ind]);
            lazy[2*ind+1]=max(lazy[2*ind+1],lazy[ind]);
        }
        lazy[ind]=0;
    }
    if(l<=left && right<=r){
        return seg[ind];
    }
    ll mid=left+(right-left)/2;
    return max(get(2*ind,left,mid,l,r),get(2*ind+1,mid+1,right,l,r));
    // return ;
}
ll getMax(ll left,ll right){
    left=max(left,0LL);
    right=min(right,(ll)N-1);
    //cout<<"Searching for range "<<left<<" "<<right<<endl;
    return get(1,0,N-1,left,right);
}
void updateMax(ll left,ll right,ll val){
    left=max(left,0LL);
    right=min(right,(ll)N-1);
    update(1,0,N-1,left,right,val);
}
void solve(ll test){
    ll n,k;
    cin>>n>>k;
    vll a(n);
    rep(i,0,n){
        cin>>a[i];
    }
    ll ans=0;
    vll dp(n,1);
    //db(a);
    rep(i,0,n){
        dp[i]=max(dp[i],getMax(a[i]-k,a[i]+k)+1);
        updateMax(a[i],a[i],dp[i]);
        ans=max(ans,dp[i]);
        //cout<<"For i= "<<i<<" answer is "<<dp[i]<<endl;
    }
    cout<<ans<<endl;

}
int main() {
    io;
    // sieve();
    factorial();
#ifndef ONLINE_JUDGE
    freopen("input1.txt", "r", stdin);
    // freopen("output1.txt","w",stdout);
#endif

    ll t = 1;
    //cin >> t;
    fix(12);
    rep(q, 1, t + 1) {
        // cout<<"Test case : "<<q<<endl;
        solve(q);
        //solve2();
    }
    return 0;

}


Measured memory_bytes: 16184