枚举并分别LIS即可。
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1000 + 5;
const double INF = 3.0;
double line[maxn];
double dp1[maxn];
double dp2[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lf", &line[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
fill(dp1, dp1 + n, INF);
fill(dp2, dp2 + n, INF);
for (int j = 0; j < i; j++) {
*lower_bound(dp1, dp1 + n, line[j]) = line[j];
}
for (int j = n - 1; j >= i; j--) {
*lower_bound(dp2, dp2 + n, line[j]) = line[j];
}
int cnt1 = lower_bound(dp1, dp1 + n, INF) - dp1;
int cnt2 = lower_bound(dp2, dp2 + n, INF) - dp2;
ans = max(ans, cnt1 + cnt2);
}
printf("%d\n", n - ans);
return 0;
}