#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define db double
#define fi first
#define se second
using namespace std;
const int Max=6e5+5,Mod=998244353,inf=0x7fffffff,KMax=32;
namespace mygr{
	ll qpow(ll a,ll b){
		ll ans=1;
		while(b)
		{	if(b&1)
			ans=(ans*a)%Mod;
			a=(a*a)%Mod;b>>=1;
		}return ans;}
	ll read()
	{
		char c=getchar();
		ll w=1,a=0;
		while(!isdigit(c)){
			if(c=='-')w=-1;
			c=getchar();}
		while(isdigit(c)){
			a=a*10+c-'0';
			c=getchar();}
		return a*w;
	}
	struct graph{
		struct edge{
			int to,next;
		}p[Max*2];
		int head[Max],last[Max],idx=0;
		void add(int u,int v)
		{
			if(!head[u])
				head[u]=++idx;
			else
				p[last[u]].next=++idx;
			last[u]=idx;
			p[idx].to=v;
		}
	};
	struct vector2{
		db x,y;
		vector2()
		{x=y=0;}
		vector2(db xx,db yy)
		{x=xx;y=yy;}
		friend vector2 operator + (vector2 A,vector2 B)
		{return vector2(A.x+B.x,A.y+B.y);}
		friend vector2 operator - (vector2 A,vector2 B)
		{return vector2(A.x-B.x,A.y-B.y);}
		friend db operator * (vector2 A,vector2 B)
		{return A.x*B.y-A.y*B.x;}
		friend db dot(vector2 A,vector2 B)
		{return A.x*B.x+A.y*B.y;}
	};
}
using namespace mygr;
int n,K;
struct sol{
	struct Stack{
		int s[Max],head,p[Max][KMax],x[Max][KMax],p2[Max][KMax],ms[KMax];
		bool (*cmp)(int A,int B);
		void insert(int num,int nf[])
		{
			int Mx[KMax],Mx2[KMax];
			for(int i=0;i<=K;i++)
			{
				Mx2[i]=Mx[i]=nf[i]+1;
			}
				
			while(head and (*cmp)(s[head],num))
			{
				for(int i=0;i<=K;i++)
				{
					Mx[i]=max(Mx[i],x[head][i]+1);
					Mx2[i]=max(Mx2[i],p2[head][i]+1);
				}
				head--;
			}
			head++;
			s[head]=num;
			for(int i=0;i<=K;i++)
			{
				p[head][i]=max(p[head-1][i]+1,Mx[i]);
				p2[head][i]=Mx2[i];
				ms[i]=max(ms[i],p2[head][i]);
				x[head][i]=Mx[i]-1;
			}
		}
	}s;
	void clear()
	{
		s.head=0;
		memset(s.ms,0,sizeof(s.ms));
		memset(s.p,0,sizeof(s.p));
		memset(s.p2,0,sizeof(s.p2));
		memset(s.x,0,sizeof(s.x));
		memset(s.s,0,sizeof(s.s));
	}
}S1;
int f[Max][KMax];
bool cmp1(int A,int B)
{
	return A<B;
}
bool cmp2(int A,int B)
{
	return A>B;
}
int solve(int a[])
{
	memset(f,0,sizeof(f));
	for(int i=0;i<=K;i++)
		S1.s.ms[i]=S1.s.p[0][i]=-inf;
	for(int i=1;i<=K;i++)
		f[0][i]=-inf;
	for(int i=1;i<=n;i++)
	{
		S1.s.insert(a[i],f[i-1]);
		for(int j=1;j<=K;j++)
			f[i][j]=max(S1.s.p[S1.s.head][j-1],S1.s.ms[j-1]);
		f[i][0]=-inf;
	}
	if(K==0)
		return max(S1.s.ms[0],S1.s.p[S1.s.head][0]);
	return f[n][K];
}
int a[Max*2];
signed main()
{
	S1.s.cmp=cmp1;
	scanf("%d%d",&n,&K);
	int pos=-1;
	for(int i=1;i<=n;i++)
	{
		a[i]=read();
		if(a[i]==n)pos=i;
	}
	for(int i=1;i<pos;i++)
		swap(a[i],a[n+i]);
	for(int i=1;i<=n;i++)
		swap(a[i],a[i+pos-1]);
	int ans=solve(a);
	S1.clear();
	
	reverse(a+2,a+1+n);
	ans=max(ans,solve(a));
	printf("%d",ans);
}