/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctz(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
const ll mod = (ll) 998244353;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less< ll >, rb_tree_tag,tree_order_statistics_node_update>
const ll N = 5e5 + 5;
struct seg_tree{
struct typo{
ll mx;
void setup(){
mx = 0;
}
};
vector < typo > b;
ll n;
void init(ll l, ll r, ll node){
b[node].setup();
return;
}
typo merge(typo a, typo b){
typo c;
c.mx = max({a.mx , b.mx});
return c;
}
void build(ll l, ll r, ll node){
if(l == r){
init(l,r,node);
return;
}
ll mid = (l + r)/2;
ll n1 = 2*node;
ll n2 = n1 + 1;
build(l, mid , n1);
build(mid+1, r, n2);
b[node] = merge(b[n1] , b[n2]);
return;
}
void build(ll _n){
n = _n;
b.resize(0);
b.resize(4*n);
build(1,n,1); // optional
}
void up(ll l, ll r, ll node, ll x, ll y, ll v){
if(y < l || x > r) return;
if(x <= l && y >= r){
b[node].mx = v;
return;
}
ll mid = (l + r)/2;
ll n1 = 2*node;
ll n2 = n1 + 1;
up(l , mid , n1 , x , y , v);
up(mid + 1, r, n2, x, y , v);
b[node] = merge(b[n1] , b[n2]);
return;
}
void up(ll x, ll y, ll v){
up(1,n,1,x,y,v);
return;
}
typo get(ll l, ll r, ll node, ll x, ll y){
if(y < l || x > r) return {0};
if(x <= l && y >= r){
return b[node];
}
ll mid = (l + r)/2;
ll n1 = 2*node;
ll n2 = n1 + 1;
return merge(get(l , mid , n1 , x , y) , get(mid + 1, r , n2 , x , y));
}
ll get(ll l, ll r){
return get(1,n,1,l,r).mx;
}
/* Final Check!!!
1. Typo, Okay?
2. Init Okay? (Build!!)
3. Merge, Okay?
4. Lazy Needed ? YES | NO (if NO, REMOVE anything related to lazy prop)
5. Dummy?
6. Check Update, Get, etc function's Merge, Lazy Prop , Init :D
7, Even after a WA, check for possible Out Of Bound/MLE/RE cases
*/
}T;
set < ii > s;
set < ll > t;
ll n , d;
void add(ll l, ll r){
if(r < l) return;
if(r - l + 1 < d) return;
s.in({l , r});
t.in(r - d);
return;
}
void rem(ll x){
auto p = s.lower_bound({x + 1, -1});
if(p == s.begin()) return;
p--;
auto [l , r] = *p;
if(l <= x && x <= r){
s.erase({l, r});
if(r-d)t.erase(r - d);
add(l, x-1);
add(x+1, r);
}
return;
}
void solve(){
cin >> n >> d;
vector < ii > idx;
for(ll i = 1; i <= n; i++){
ll a; cin >> a;
idx.pb({a , -i});
}
T.build(n);
t.in(0);
add(1,n);
sort(idx.begin(), idx.end());
ll ans = 1;
for(auto [val , i] : idx){
i = -i;
rem(i);
auto p = --t.upper_bound(i);
ll j = *p;
ll mx = T.get(j + 1, i) + 1;
ans = max(mx , ans);
T.up(i,i, mx);
}
cout << ans << '\n';
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre(N);
ll T = 1;
//cin >> T;
ll CT = 0;
while(T--){
// cout << "Case #" << ++CT <<": " ;
solve();
}
return 0;
}
