显示代码纯文本
#include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <cmath>
#include <algorithm>
using namespace std;
//1759
const int maxn=30000+1;
int f[maxn],a[maxn],n,g[maxn],tmp,cnt=INT_MAX;
int main()
{
freopen ("egroup.in","r",stdin);
freopen ("egroup.out","w",stdout);
scanf("%d",&n);
for (int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
if (a[i]==a[i-1]) g[i]=g[i-1];
else
{
for (int j=1; j<i; j++)
{
if (a[j]>=a[i] && g[i]<g[j])
g[i]=g[j];
}
}
g[i]++;
cnt=min(cnt,n-g[i]);
}
cout<<cnt<<endl;
return 0;
}