#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=3e5+5;
int n,D,a[N],b[N],c[N],cnt,f[N],p[N],mx[21][N],ans,s[N];
vi v[N];

int lb(int x) {return x&-x;}
void add(int x,int y) {for(;x<=cnt;x+=lb(x)) chmax(s[x],y);}
void clear(int x) {for(;x<=cnt;x+=lb(x)) s[x]=0;}
int qrys(int x,int y=0) {for(;x;x-=lb(x)) chmax(y,s[x]); return y;}

int qmin(int l,int r) {
  int h=__lg(r-l+1);
  return min(mx[h][l],mx[h][r-(1<<h)+1]);
}
int qmax(int l,int r) {
  int h=__lg(r-l+1); if(l>r) return -1;
  return max(mx[h][l],mx[h][r-(1<<h)+1]);
}

void work(int l,int r) {
  if(l==r) {chmax(f[l],1), chmax(ans,f[l]); return;} int mid=l+r>>1;
  work(l,mid);
  rep(i,l,mid) v[i].clear();
  rep(i,mid+1,r) if(p[i]<=mid) v[max(l,p[i])].eb(i);
  per(i,mid,l) {
    add(a[i],f[i]+1);
    for(int x:v[i]) chmax(f[x],qrys(a[x]-1));
  }
  per(i,mid,l) clear(a[i]);
  work(mid+1,r);
}

signed main() {
  n=read(), D=read();
  rep(i,1,n) a[i]=read(), c[i]=a[i];
  sort(c+1,c+n+1); cnt=unique(c+1,c+n+1)-c-1;
  rep(i,1,n) a[i]=lower_bound(c+1,c+n+1,a[i])-c;
  rep(i,1,n) mx[0][i]=a[i];
  rep(h,1,20) rep(i,1,n) if(i+(1<<h)-1<=n)
    mx[h][i]=min(mx[h-1][i],mx[h-1][i+(1<<h-1)]);
  rep(i,1,n-D) b[i]=qmin(i,i+D-1), mx[0][i]=b[i];
  rep(h,1,20) rep(i,1,n) if(i+(1<<h)-1<=n)
    mx[h][i]=max(mx[h-1][i],mx[h-1][i+(1<<h-1)]);
  rep(i,2,n) {
    if(i<=D) p[i]=1;
    else {
      int l=1, r=i-D;
      while(l<=r) {
        int mid=l+r>>1;
        if(qmax(mid+1,i-D)<a[i]) p[i]=mid, r=mid-1;
        else l=mid+1;
      }
    }
  }
  work(1,n);
  printf("%d\n",ans);
  return 0;
}