#include <bits/stdc++.h>

 using namespace std;

 const int maxn = ;

 int tree[maxn<<],Lisan[maxn],a[maxn],tot,n,d;

 int query(int L,int R,int lt,int rt,int v){

     if(lt <= L && rt >= R) return tree[v];

     int mid = (L + R)>>,ret = ;

     if(lt <= mid) ret = query(L,mid,lt,rt,v<<);

     if(rt > mid) ret = max(ret,query(mid + ,R,lt,rt,v<<|));

     return ret;

 }

 void update(int L,int R,int pos,int val,int v){

     if(L == R){

         tree[v] = max(tree[v],val);

         return;

     }

     int mid = (L + R)>>;

     if(pos <= mid) update(L,mid,pos,val,v<<);

     if(pos > mid) update(mid + ,R,pos,val,v<<|);

     tree[v] = max(tree[v<<],tree[v<<|]);

 }

 int main(){

     while(~scanf("%d%d",&n,&d)){

         memset(tree,,sizeof tree);

         for(int i = ; i < n; ++i){

             scanf("%d",a + i);

             Lisan[i] = a[i];

         }

         sort(Lisan,Lisan + n);

         tot = unique(Lisan,Lisan + n) - Lisan;

         int ret = ;

         for(int i = ; i < n; ++i){

             int L = max(,(int)(lower_bound(Lisan,Lisan + tot,a[i] - d) - Lisan + ));

             int R = min(tot,(int)(upper_bound(Lisan,Lisan + tot,a[i] + d) - Lisan));

             int tmp = ,pos = lower_bound(Lisan,Lisan + tot,a[i]) - Lisan + ;

             if(L <= R) tmp = query(,tot,L,R,) + ;

             ret = max(ret,tmp);

             update(,tot,pos,tmp,);

         }

         printf("%d\n",ret);

     }

     return ;

 }