#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".in").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
const int MX = 2e5+5;
int N, X, A[MX], R[MX], ans;
void solve() {
cin>>N>>X;
F0R(i,N) cin>>A[i];
vi v;
R0F(i,N) {
int p = lower_bound(all(v), -A[i]) - begin(v);
if(p == sz(v)) v.pb(-A[i]);
else v[p] = -A[i];
R[i] = p;
}
v.clear();
F0R(i,N) {
int p = lower_bound(all(v), A[i]) - begin(v);
ans = max(ans, R[i] + 1 + p);
p = lower_bound(all(v), A[i] - X) - begin(v);
if(p == sz(v)) v.pb(A[i] - X);
else v[p] = A[i] - X;
}
cout << ans << nl;
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
