#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
vi x, y, z;
int n,k;
int lis(vi &v, int a){
int n = v.size();
vi dp(n);
dp[0] = 1;
vi l(n+1, 4e18);
l[1] = v[0];
l[0] = -4e18;
vi dp2(n);
dp2[0] = 1;
FOR(i, 1, n){
//last one less than v[i]
int lo = 0;
int hi = n;
while(lo < hi){
int mid = lo + (hi - lo + 1) / 2;
if(l[mid] < v[i]){
lo = mid;
}
else{
hi = mid - 1;
}
}
int save = lo;
lo = 0;
hi = n;
while(lo < hi){
int mid = lo + (hi - lo + 1) / 2;
if(l[mid] < v[i] + k){
lo = mid;
}
else{
hi = mid - 1;
}
}
dp2[i] = lo + 1;
dp[i] = save + 1;
l[save + 1] = min(l[save + 1], v[i]);
}
if(a == 1){
x = dp;
z = dp2;
}
if(a == 2)y = dp;
return max(*max_element(all(dp)), *max_element(all(dp2)));
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
cin>>n>>k;
vin(v,n);
if(true){
vi cur;
lis(v, 1);
vi w;
for(int i = n-1; i>=0; i--){
w.pb(-v[i]);
}
lis(w,2);
// vout(x);
// vout(y);
// vout(z);
int ans = x[n-1];
f0r(i,n){
ans = max(ans, z[i] + y[n-1-i] - 1);
}
/*
for(int i = n-1; i>=0; i--){
v[i] += k;
ans = max(ans, lis(v,0));
}
*/
out(ans);
}
else if(k == 0){
out(lis(v,0));
}
else if(k == 1e9){
lis(v, 1);
vi w;
for(int i = n-1; i>=0; i--){
w.pb(-v[i]);
}
lis(w,2);
// vout(x);
// vout(y);
FOR(i, 1, n){
x[i] = max(x[i], x[i-1]);
y[i] = max(y[i], y[i-1]);
}
int ans = max(x[n-1], y[n-1]);
f0r(i, n-1){
ans = max(ans, x[i] + y[n-2-i]);
}
out(ans);
}
}
