题目链接:点击这里
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 110;
int a[N], f[N], g[N];
int n;
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for(int i = 1; i <= n; ++i)
{
f[i] = 1;
for(int j = 1; j < i; ++j)
if(a[j] < a[i]) f[i] = max(f[i], f[j] + 1);
}
for(int i = n; i; --i)
{
g[i] = 1;
for(int j = n; j > i; --j)
if(a[j] < a[i]) g[i] = max(g[i], g[j] + 1);
}
int maxx = -1;
for(int i = 1; i <= n; ++i)
maxx = max(maxx, f[i] + g[i] - 1);
printf("%d\n", n - maxx);
return 0;
}