/*
Normie's Template v2.0
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
struct seg
{
int val[800001];
void update(int l, int r, int cur, int t, int x)
{
if ((l<=t)and(t<=r))
{
val[cur]=max(val[cur],x);
if (l<r)
{
int mid=(l+r)/2;
update(l,mid,(cur<<1),t,x);
update(mid+1,r,(cur<<1)+1,t,x);
}
}
}
int get(int l, int r, int cur, int tl, int tr)
{
if (tl>tr) return -1;
if ((tl>r)or(tr<l)) return -1;
if ((tl<=l)and(tr>=r)) return val[cur];
else
{
int mid=(l+r)/2;
int a=get(l,mid,(cur<<1),tl,tr);
int b=get(mid+1,r,(cur<<1)+1,tl,tr);
return (max(a,b));
}
}
};
seg st[2];
int dp[200001][2];
int arr[200001];
int n,m,i,j,k,t,t1,u,a,b,d,res=1;
vector<int> v;
int main()
{
fio;
cin>>n>>d;
for (i=1;i<=n;i++)
{
cin>>arr[i];
v.push_back(arr[i]);
}
sort(v.begin(),v.end());
auto las=unique(v.begin(),v.end());
v.erase(las,v.end());
for (i=1;i<=n;i++)
{
arr[i]=lower_bound(v.begin(),v.end(),arr[i])-v.begin();
}
dp[1][0]=1;
dp[1][1]=1;
for (i=2;i<=n;i++)
{
st[0].update(0,n-1,1,arr[i-1],dp[i-1][0]);
st[1].update(0,n-1,1,arr[i-1],dp[i-1][1]);
u=st[0].get(0,n-1,1,0,arr[i]-1);
dp[i][0]=max(dp[i][0],u);
u=st[1].get(0,n-1,1,0,arr[i]-1);
dp[i][1]=max(dp[i][1],u);
u=st[0].get(0,n-1,1,0,lower_bound(v.begin(),v.end(),v[arr[i]]+d)-v.begin()-1);
dp[i][1]=max(dp[i][1],u);
dp[i][0]++;
dp[i][1]++;
res=max(res,dp[i][0]);
res=max(res,dp[i][1]);
}
cout<<res;
}
