#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>

//#include <bits/stdc++.h>
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i,i0,n) for(int (i)=(i0);(i)<(n);(i)++)
#define FORR(i,i0,n) for(int (i)=(n)-1; (i)>=(i0);(i)--)
#define SORT(x) sort(x.begin(),x.end())
#define SORTR(x) sort(x.begin(),x.end(),greater<vector<int>>())

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple

using namespace std;
using ll = long long;
typedef std::pair<int, int> pii;
typedef std::pair<int, double> pid;
typedef std::vector<int> vi;
typedef std::vector<pii> vii;

#define PI 3.14159265358979323846264338327950L


const int mod = 998244353;





struct item{ // CHANGE
    ll val;
};

class SegTree{
public:
    int size;
    vector<item> values;
    
    SegTree(int n){
        size = 1;
        while(size<n) size*=2;
        values.resize(size*2-1);
    }
    
    item NEUTRAL_ELEMENT = {0}; // CHANGE
    item single(ll val) { // CHANGE
        return {val};
    }
    item merge(item a, item b){ // CHANGE
        return {max(a.val,b.val)};
    }
    
    
    void build(vector<ll>& a){
        build(a,0,0,size);
    };
    void build(vector<ll>& a, int node, int nodeL, int nodeR){
        if (nodeR-nodeL == 1) {
            if(nodeL<a.size()) values[node] = single(a[nodeL]); // SINGLE
            return;
        }
        int m = (nodeL+nodeR)/2;
        build(a,node*2+1,nodeL,m);
        build(a,node*2+2,m,nodeR);
        values[node] = merge(values[node*2+1],values[node*2+2]);
    }
    
    
    
    void set(int index, int val){
        set(index,val,0,0,size);
    }
    void set(int index, int val, int node, int nodeL, int nodeR){
        if (nodeR-nodeL==1) {
            values[node]= single(val); // SINGLE
            return;
        }
        int m = (nodeL+nodeR)/2;
        if (index < m) set(index,val,node*2+1,nodeL,m);
        else set(index,val,node*2+2,m,nodeR);
        values[node] = merge(values[node*2+1],values[node*2+2]);
    }
   
    
    
    void add(int index, int val){
        add(index,val,0,0,size);
    }
    void add(int index, int val, int node, int nodeL, int nodeR){
        if (nodeR-nodeL==1) {
            values[node].val += val; // SINGLE
            return;
        }
        int m = (nodeL+nodeR)/2;
        if (index < m) add(index,val,node*2+1,nodeL,m);
        else add(index,val,node*2+2,m,nodeR);
        values[node] = merge(values[node*2+1],values[node*2+2]);
    }
    
    
    
    item calc(int l, int r){
        return calc(l,r,0,0,size); 
    }
    item calc(int l,int r, int node, int nodeL, int nodeR){
        if (r<=nodeL || l>=nodeR) return NEUTRAL_ELEMENT;
        if (l<=nodeL && nodeR<=r) return values[node];
        int m = (nodeL+nodeR)/2;
        return merge(calc(l,r,node*2+1,nodeL,m),calc(l,r,node*2+2,m,nodeR));
    }
    
    
    int find(int k){
        return find(k,0,0,size);
    }
    int find(int k, int node, int nodeL,int nodeR){
        if (nodeR-nodeL==1) return nodeL;
        int m = (nodeL+nodeR)/2;
        int lsum = values[2*node+1].val;
        if(k<=lsum) return find(k,2*node+1,nodeL,m);
        else return find(k-lsum,2*node+2,m,nodeR);
    }
    
    int findAbove(int x, int l){
        return findAbove(x,l,0,0,size);
    }
    int findAbove(int x, int l, int node, int nodeL, int nodeR){
        if (values[node].val<x || nodeR<=l) return -1;
        if (nodeR-nodeL==1) return nodeL;
        int m = (nodeR+nodeL)/2;
        int cand = findAbove(x,l,node*2+1, nodeL,m);
        if (cand==-1) cand = findAbove(x,l,node*2+2,m,nodeR);
        return cand;
    }
    
};



void solve(){
    
    int n,k;
    cin >> n >> k;
    
    
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    
    int mxe = *max_element(begin(a),end(a));
    SegTree st(mxe);
    
    rep(i,n){
        int mn = max(0,a[i]-k);
        int mx = a[i]+k;
        int v = st.calc(mn,mx+1).val;
        st.set(a[i],max(1,v+1));
    }
    
    cout << st.calc(0,mxe+1).val;
}




int main() {
    int T;
    
    T = 1;
    //cin >> T;
    
    while (T--) {
        solve();
        cout << endl;
    }
}




Measured memory_bytes: 12768