#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * 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);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
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 = 1e9 + 69;
struct SegmentTree{
int n;
vector<int> a;
SegmentTree(int _n){
n = _n;
a.resize(n * 2 + 2, -INF);
}
void update(int i, int v){
i += n; if (!maximize(a[i], v)) return;
while(i > 1){
i >>= 1;
a[i] = max(a[i * 2], a[i * 2 + 1]);
}
}
int get(int l, int r){
l += n; r += n + 1;
int ans = -INF;
while(l < r){
if (l & 1) maximize(ans, a[l++]);
if (r & 1) maximize(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
struct DSU{
int n;
vector<int> parent, sz, ma;
DSU(int _n){
n = _n;
parent.resize(n+1); sz.resize(n+1, 1);
for(int i = 1; i<=n; ++i) parent[i] = i;
ma = parent;
}
int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
bool same_set(int u, int v){return find_set(u) == find_set(v);}
bool join_set(int u, int v){
u = find_set(u), v = find_set(v);
if (u != v){
if (sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
maximize(ma[u], ma[v]);
return true;
}
return false;
}
int get_size(int u){return sz[find_set(u)];}
int get_ma(int u){return ma[find_set(u)];}
};
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
int n, d; cin >> n >> d;
vector<int> a(n+1);
for(int i =1 ; i<=n; ++i) cin >> a[i];
vector<pair<int, int>> poopoo;
for(int i = 1; i<=n; ++i) poopoo.push_back({a[i], i});
sort(ALL(poopoo), [](pair<int, int> x, pair<int, int> y){
return make_pair(x.first, -x.second) < make_pair(y.first, -y.second);
});
DSU mst(n+1);
set<int> S;
S.insert(0);S.insert(n+1);
vector<int> reach(n+1);
for(pair<int, int> i: poopoo){
S.insert(i.second);
auto it = S.lower_bound(i.second);
it++;
int R = *it;
it--; it--;
int L = *it;
if (i.second - L <= d) mst.join_set(i.second, L);
if (R - i.second <= d) mst.join_set(i.second, R);
reach[i.second] = min(mst.get_ma(i.second) + d, n+1);
}
reverse(ALL(poopoo));
SegmentTree st(n+1); st.update(n+1, 0);
int ans = 0;
for(pair<int, int> i: poopoo){
int cur = st.get(i.second + 1, reach[i.second]) + 1;
st.update(i.second, cur);
maximize(ans, cur);
}
cout << ans << "\n";
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
