//#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("avx,avx2") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2") //#pragma GCC optimize("trapv") #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define all(x) x.begin(), x.end() #define mpr make_pair typedef long long ll; typedef unsigned long long ull; typedef long double ld; const int nmax = 200011, mod = 1000000007, inf = 2000010000, key = 200003, lg = 20, block = 300; const ll infll = 4000000000000000000; const ld eps = 1e-9; int tree[nmax * 4] = {0}; void upd(int v, int tl, int tr, int ind, int val) { if(tl == tr) { tree[v] = val; return ; } int m = (tl + tr) / 2; if(ind <= m) upd(v << 1, tl, m, ind, val); else upd(v << 1 | 1, m + 1, tr, ind, val); tree[v] = max(tree[v << 1], tree[v << 1 | 1]); return ; } int query(int v, int tl, int tr, int ind) { if(ind > tr) return 0; if(tl == tr) return tree[v]; int m = (tl + tr) / 2; if(ind <= m + 1) return max(tree[v << 1 | 1], query(v << 1, tl, m, ind)); return query(v << 1 | 1, m + 1, tr, ind); } void solve() { int n, x; cin >> n >> x; vector<int> vc(n); for(int i = 0; i < n; i++) cin >> vc[i]; vector<int> lis(n + 1, inf); lis[0] = 0; vector<int> pref(n); for(int i = 0; i < n; i++) { auto ind = lower_bound(all(lis), vc[i]) - lis.begin(); pref[i] = ind; lis[ind] = vc[i]; } vector<int> suf(n), lds(n + 1, 0); lds[0] = -inf; for(int i = n - 1; i >= 0; i--) { auto ind = lower_bound(all(lds), -vc[i]) - lds.begin(); suf[i] = ind; lds[ind] = -vc[i]; } vector<array<int, 2>> order(n); for(int i = 0; i < n; i++) order[i] = {vc[i], -i}; sort(all(order)); queue<array<int, 2>> q; int ans = 0; for(int i = 0; i < n; i++) { while(!q.empty() && q.front()[0] + x <= order[i][0]) { int ind = -q.front()[1]; upd(1, 0, n - 1, ind, 0); q.pop(); } int ind = -order[i][1]; //cout << ind << " " << pref[ind] << " " << query(1, 0, n - 1, ind + 1) << "\n"; ans = max(ans, pref[ind] + query(1, 0, n - 1, ind + 1)); q.push(order[i]); upd(1, 0, n - 1, ind, suf[ind]); } cout << ans << "\n"; return ; } int main() { //freopen("exercise.in","r",stdin); //freopen("exercise.out","w",stdout); ios_base::sync_with_stdio(0);cin.tie(0); srand(8713); //init(); int t = 1; //cin >> t; //int t_ = t; //t = rdi(); while(t--) { //cout << "Case #" << t_ - t << ": "; solve(); } //flush(); return 0; } /* */