#include<bits/stdc++.h>
#define ll long long
using namespace std;const int N=6e5+5;
int n,m,w,p[N],P[N],tot,st[N],id[N],s[N],ls[N],rs[N],f[N],g[N],mx[21][N],v[N],ans;
int ask(int l,int r){int len=__lg(r-l+1);return max(mx[len][l],mx[len][r-(1<<len)+1]);}
void sol(){memset(f,-0x3f,sizeof(f)),f[0]=tot=0;
	for(int i=w;i<=n;i++)p[i-w+1]=P[i];for(int i=1;i<w;i++)p[n-w+1+i]=P[i];
	for(int i=1;i<=n;i++){int lst=0;while(tot&&st[tot]<p[i])rs[id[tot]]=lst,lst=id[tot--];
		ls[i]=lst,st[++tot]=p[i],id[tot]=i;
	}
	for(int k=1;k<=m;k++){memset(g,-0x3f,sizeof(g)),tot=0;for(int i=1;i<=n;i++)mx[0][i]=f[i];
		for(int j=1;j<=20;j++)for(int i=1;i<=n-(1<<j)+1;i++)mx[j][i]=max(mx[j-1][i],mx[j-1][i+(1<<j-1)]);
		for(int res=-1e9,i=1;i<=n;i++){while(tot&&st[tot]<p[i])tot--;
			if(tot)s[tot]=max(ask(id[tot-1],id[tot]-1),s[tot-1])+1;
			v[i]=f[i-1];int u=ls[i];while(u)v[i]=max(v[i],v[u]),u=rs[u];res=max(res,++v[i]);
			g[i]=max(res,max(s[tot],ask(id[tot],i-1))+1),st[++tot]=p[i],id[tot]=i;
		}memcpy(f,g,sizeof(f));
	}for(int i=1;i<=n;i++)ans=max(ans,f[i]);
}
int main(){//freopen("seq.in","r",stdin),freopen("seq.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m,s[0]=-1e9;for(int i=1;i<=n;i++)cin>>P[i],P[i]==n&&(w=i);
	sol(),reverse(P+1,P+1+n),sol(),cout<<ans;
}