/*-----------------------------
Author : TgX.2
11Ti - K28 - CHV
-----------------------------*/
#include <bits/stdc++.h>
using namespace std;
#ifdef TGX
#include "debug.h"
#else
#define debug(...)
#endif
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i += 1)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i -= 1)
#define fi first
#define se second
#define pb push_back
#define len(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define _ << " " <<
#define __ << "\n"
#define ___ << " "
#define ______________TgX______________ main()
#define int long long
#define intmax 1e9
#define intmin -1e9
#define llongmax 1e18
#define llongmin -1e18
#define memo(a, val) memset((a), (val), sizeof((a)))
struct custom {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template<class T1, class T2> using cmap = unordered_map<T1, T2, custom>;
template<typename T1, typename T2>
bool mini(T1 &a, T2 b)
{if (a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2>
bool maxi(T1 &a, T2 b)
{if (a < b) a = b; else return 0; return 1;}
/*-----------------------------*/
const int maxn = 2e5 + 7;
int n, d, a[maxn];
namespace sub12 {
int dp[100], b[100];
int lis(int diff, int l, int r) {
FOR(i, 1, n) {
if (l <= i and i <= r) b[i] = a[i] + diff;
else b[i] = a[i];
}
int ans = 0;
FOR(i, 1, n) {
dp[i] = 1;
FORD(j, i - 1, 1) if (b[i] > b[j])
maxi(dp[i], dp[j] + 1);
maxi(ans, dp[i]);
}
return ans;
}
void sol() {
int ans = 0;
FOR(diff, -d, d) {
FOR(i, 1, n) FOR(j, i, n)
maxi(ans, lis(diff, i, j));
}
cout << ans;
}
};
namespace sub4 {
int last[maxn];
void sol() {
int ans = 0;
FOR(i, 1, n) {
int x = lower_bound(last + 1, last + 1 + ans, a[i]) - last;
if (x == ans) {
ans++;
last[x] = a[i];
} else mini(last[x], a[i]);
}
cout << ans;
}
};
void process() {
cin >> n >> d;
FOR(i, 1, n) cin >> a[i];
if (n <= 50 and d <= 50) sub12::sol();
else if (d == 0) sub4::sol();
}
/*-----------------------------*/
______________TgX______________ {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen("temp.inp", "r")) {
freopen("temp.inp", "r", stdin);
freopen("temp.out", "w", stdout);
}
process();
cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s." __ ;
}
/*==============================+
|INPUT |
--------------------------------|
================================+
|OUTPUT |
--------------------------------|
===============================*/
