#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int INF = 2e9 + 69;
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, d; cin >> n >> d;
vector<int> a(n);
for(int i = 0; i<n; ++i) cin >> a[i];
vector<int> st(n+1, 0); st[0] = INF;
vector<int> suff(n+1);
int ans = 0;
for(int i = n-1; i>=0; --i){
int idx = lower_bound(ALL(st), a[i], greater<int>()) - st.begin();
suff[i] = idx;
st[idx] = a[i];
maximize(ans, idx);
}
st = vector<int>(n+1, INF); st[0] = 0;
for(int i = 0; i<n-1; ++i){
int idx = lower_bound(ALL(st), a[i]) - st.begin();
st[idx] = a[i];
idx = lower_bound(ALL(st), a[i+1] + d) - st.begin();
maximize(ans, idx + suff[i+1] - 1);
}
cout << ans << "\n";
return 0;
}
