还是最长上升子序列的三种运用方式
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
int a[N], f1[N], f2[N], f3[N];
int main()
{
int n;
cin >> n;
int ans = 1;
for (int i = 0; i < n; i ++ ) cin >> a[i];
for(int i = 0; i < n; i++) f1[i] = 1, f2[i] = 1, f3[i] = 1;
for (int i = 0; i < n; i ++ )
{
for (int j = i; j >= 0; j -- )
{
if(a[i] > a[j]) f1[i] = max(f1[i], f1[j]+1); // 最长上升子序列
if(a[i] < a[j]) f2[i] = max(f2[i], f2[j]+1); // 最长下降子序列
}
}
for(int i = 0; i < n; i++) ans = max({ans, f1[i], f2[i]});
for(int i = n-1; i >= 0; i--)
{
for(int j = i; j < n; j++)
{
if(a[i] > a[j]) f3[i] = max(f3[i], f3[j]+1);
}
}
for(int i = 0 ; i < n; i++) ans = max(ans, f1[i]+f3[i]-1);
cout << n - ans;
return 0;
}