#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
ll sta[200001];
// A list of preset merge functions.
ll cmpg(ll a, ll b){if (a>b) return a; else return b;}
ll cmpl(ll a, ll b){if (a>b) return b; else return a;}
ll sum(ll a, ll b){return (a+b);}
ll summ(ll a, ll b){return (a+b)%MOD;}
ll prod(ll a, ll b){return (a*b);}
ll prodm(ll a, ll b){return (a%MOD*b)%MOD;}
ll bAND(ll a, ll b){return (a&b);}
ll bOR(ll a, ll b){return (a|b);}
ll bXOR(ll a, ll b){return (a^b);}
//The segement tree itself.
struct seg
{
ll val[1100001];
ll def=0;
ll (*merg)(ll,ll) = cmpg; // Merge function. It must be associative.
void reset(ll c, ll l, ll r)
{
if (l<r)
{
ll mid=(l+r)/2;
reset((c<<1),l,mid);
reset((c<<1)+1,mid+1,r);
val[c]=merg(val[(c<<1)],val[(c<<1)+1]);
}
else val[c]=sta[l];
}
void upd(ll c, ll l, ll r, ll x, ll t)
{
if ((l<=x)and(x<=r))
{
if (l==r) val[c]=t;
else
{
ll mid=(l+r)/2;
upd((c<<1),l,mid,x,t);
upd((c<<1)+1,mid+1,r,x,t);
val[c]=merg(val[(c<<1)],val[(c<<1)+1]);
}
}
}
ll get(ll c, ll l, ll r, ll tl, ll tr)
{
if (tl>tr) return def;
if ((tl>r)or(tr<l)) return def;
if ((tl<=l)and(tr>=r)) return val[c];
else
{
ll mid=(l+r)/2;
ll a=get((c<<1),l,mid,tl,tr);
ll b=get((c<<1)+1,mid+1,r,tl,tr);
return merg(a,b);
}
}
};
seg st;
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
vector<pii(int)> vec;
int n,m,i,j,k,t,t1,u,v,a,b,res;
int arr[300001];
int mn[300001];
int r[300001];
int dp[300001];
vector<int> buc[300001];
map<int,int> lmao;
vector<int> dq;
set<int> lul;
multiset<int> mx[300001];
int main()
{
fio;
cin>>n>>m;
j=0;
for (i=1;i<=n;i++) {
cin>>arr[i];
lmao[arr[i]]=1;
}
for (auto& g : lmao) {
t++;
g.se=t;
}
for (i=1;i<=n;i++) arr[i]=lmao[arr[i]];
for (i=1;i<=n;i++) {
while(dq.size()>j && dq.back()>arr[i]) {
dq.pop_back();
}
dq.push_back(arr[i]);
if (i-m>=1 && dq[j]==arr[i-m]) {
j++;
}
if (i-m>=0) {mn[i]=dq[j]; vec.push_back({mn[i],-i});}
}
for (i=1;i<=n;i++) vec.push_back({mn[i],i});
sort(vec.begin(),vec.end());
reverse(vec.begin(),vec.end());
for (auto g : vec) {
if (g.se<0) {
lul.insert(-g.se);
}
else {
auto it = lul.lower_bound(g.se+m);
if (it!=lul.end()) r[g.se]=(*it); else r[g.se]=n;
}
}
for (i=1;i<=n;i++) buc[r[i]+1].push_back(i);
st.reset(1,1,t);
// for (i=1;i<=n;i++) cout<<arr[i]<<' '; cout<<endl;
for (i=1;i<=t;i++) {
st.upd(1,1,t,i,-1e9);
mx[i].insert(-1e9);
}
for (i=1;i<=n;i++) {
for (auto g : buc[i]) {
// assert(mx[arr[g]].lower_bound(dp[g])!=mx[arr[g]].end());
mx[arr[g]].erase(mx[arr[g]].lower_bound(dp[g]));
assert(mx[arr[g]].size());
auto it=mx[arr[g]].end();
it--;
u=(*it);
st.upd(1,1,t,arr[g],u);
}
u=st.get(1,1,t,arr[i]+1,t);
dp[i]=u+1;
res=max(res,dp[i]);
mx[arr[i]].insert(dp[i]);
auto it=mx[arr[i]].end();
it--;
u=(*it);
st.upd(1,1,t,arr[i],u);
}
cout<<res+1;
}
// N;
