#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define debug(x) cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define ull unsigned long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ld long double
#define nl endl
#define tb '\t'
#define sp ' '
#define sqr(x) (x)*(x)
#define arr3 array<ll, 3>
using namespace std;
const ll MX=200005, MOD=1000000007, BLOCK=160, INF=2e9+7, LG=62;
const ll INFF=1000000000000000007;
const ld ERR=1e-6, pi=3.14159265358979323846;
int N, K, A[MX], best[MX], ans;
vector<int> LIS;
int main(){
fastio;
cin >> N >> K;
for(int i=1; i<=N; i++){
cin >> A[i];
}
for(int i=1; i<=N; i++){
int tmp=A[i], idx;
if(LIS.empty() || LIS.back()<tmp){
idx=LIS.size();
LIS.pb(tmp);
}else{
idx=lower_bound(all(LIS), tmp)-LIS.begin();
LIS[idx]=tmp;
}
idx++;
best[i]=idx;
ans=max(ans, idx);
}
LIS.clear();
for(int i=N; i>0; i--){
int tmp=-A[i], idx;
if(LIS.empty() || LIS.back()<tmp){
idx=LIS.size();
}else{
idx=lower_bound(all(LIS), tmp)-LIS.begin();
}
ans=max(ans, best[i]+idx);
tmp=-A[i]-K;
if(LIS.empty() || LIS.back()<tmp){
idx=LIS.size();
LIS.pb(tmp);
}else{
idx=lower_bound(all(LIS), tmp)-LIS.begin();
LIS[idx]=tmp;
}
}
cout << ans << nl;
}
