//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcountll
#define all(a) begin(a),end(a)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
cout<<w.size()<<en;
for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
if (w.size()) cout<<w[w.size()-1]<<en;
if (fl) cout<<flush;
}
void M998()
{
swap(MOD,MOD2);
}
ll raand()
{
ll a=rund();
a*=RAND_MAX;
a+=rund();
return a;
}
#define rand raand
ll raaand()
{
return raand()*(MOD-7)+raand();
}
template<class T>
vi compress(vector<T>&v)
{
set<T> s;
for (auto a: v) s.insert(a);
vector<T> o(all(s));
vi nv;
for (int i=0;i<(int)v.size();++i) nv.pb(lower_bound(all(o),v[i])-o.begin());
return nv;
}
string to_upper(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
return a;
}
string to_lower(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
return a;
}
ll sti(string a,int base=10)
{
ll k=0;
for (int i=0;i<(int)a.size();++i)
{
k*=base;
k+=a[i]-'0';
}
return k;
}
template<class T>
void eras(vector<T>& a,T b)
{
a.erase(find(a.begin(),a.end(),b));
}
string its(ll k,int base=10)
{
if (k==0) return "0";
string a;
while (k)
{
a.push_back((k%base)+'0');
k/=base;
}
reverse(a.begin(),a.end());
return a;
}
ll min(ll a,int b)
{
if (a<b) return a;
return b;
}
ll min(int a,ll b)
{
if (a<b) return a;
return b;
}
ll max(ll a,int b)
{
if (a>b) return a;
return b;
}
ll max(int a,ll b)
{
if (a>b) return a;
return b;
}
ll gcd(ll a,ll b)
{
if (b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
return a/gcd(a,b)*b;
}
template<class T,class K>
pair<T,K> mp(T a,K b)
{
return make_pair(a,b);
}
inline int mult(ll a,ll b)
{
return (a*b)%MOD;
}
inline int pot(int n,int k)
{
if (k==0) return 1;
ll a=pot(n,k/2);
a=mult(a,a);
if (k%2) return mult(a,n);
else return a;
}
int divide(int a,int b)
{
return mult(a,pot(b,MOD-2));
}
inline int sub(int a,int b)
{
if (a-b>=0) return a-b;
return a-b+MOD;
}
inline int add(int a,int b)
{
if (a+b>=MOD) return a+b-MOD;
return a+b;
}
void ad(int&a,int b)
{
a+=b;
if (a>=MOD) a-=MOD;
}
bool prime(ll a)
{
if (a==1) return 0;
for (int i=2;i<=round(sqrt(a));++i)
{
if (a%i==0) return 0;
}
return 1;
}
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
const int N=300010,M=1<<19;
int d,n,seg[M*2+10],dp[N];
vi del[N],imb[N];
array<int,4> seg2[M*2+10],nul={1,1,1,1},jed={0,0,0,1},id={0,0,0,0};
multiset<int> im[N];
array<int,4> mer(array<int,4> a,array<int,4> b) //left, right, ans, length
{
array<int,4> c;
if (a[0]==a[3]) c[0]=a[0]+b[0];
else c[0]=a[0];
if (b[1]==b[3]) c[1]=a[1]+b[1];
else c[1]=b[1];
c[2]=max(max(a[2],b[2]),a[1]+b[0]);
c[3]=a[3]+b[3];
return c;
}
void upd(int i,array<int,4> x)
{
seg2[i+=M]=x;
for (i/=2;i;i/=2) seg2[i]=mer(seg2[i*2],seg2[i*2+1]);
}
int gef(int i)
{
i+=M;
array<int,4> cur=seg2[i];
while (i>1)
{
if (i%2==0)
{
auto cuu=mer(cur,seg2[i^1]);
if (cuu[2]>=d)
{
i^=1;
while (i<M)
{
auto cu1=mer(cur,seg2[i*2]);
if (cu1[2]>=d) i=i*2;
else cur=cu1,i=i*2+1;
}
return i-M;
}
cur=cuu;
}
i/=2;
}
return n+2;
}
void upd(int i,int x)
{
seg[i+=M]=x;
for (i/=2;i;i/=2) seg[i]=max(seg[i*2],seg[i*2+1]);
}
int ge(int l,int r,int lo=0,int hi=M,int i=1)
{
if (lo>=l && hi<=r) return seg[i];
if (lo>=r || hi<=l) return 0;
int mid=(lo+hi)/2;
return max(ge(l,r,lo,mid,i*2),ge(l,r,mid,hi,i*2+1));
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
cin>>n>>d;
vi h(n);
for (auto&a: h) cin>>a;
h=compress(h);
for (int i=0;i<n;++i) imb[h[i]].pb(i),upd(i,nul);
for (int i=0;i<n;++i)
{
for (auto a: imb[i]) upd(a,jed);
for (auto a: imb[i]) del[gef(a)].pb(a);
}
for (int i=0;i<n;++i)
{
dp[i]=ge(0,h[i])+1;
im[h[i]].insert(dp[i]);
upd(h[i],*im[h[i]].rbegin());
for (auto u: del[i])
{
//cout<<"de "<<i<<' '<<u<<en;
im[h[u]].erase(im[h[u]].find(dp[u]));
if (im[h[u]].empty()) upd(h[u],0);
else upd(h[u],*im[h[u]].rbegin());
}
//cout<<"an" <<i<<' '<<dp[i]<<en;
}
cout<<ge(0,n)<<en;
}
