30分，求调

#include<iostream>
#define re register
#define int long long
using namespace std;

int n,ans;
int a[105];
int dp1[105],dp2[105];

signed main(){
	dp1[1] = 1;
	dp2[1] = 1;
	cin>>n;
	for(re int i = 1;i <= n;i ++){
		cin>>a[i];
	}
	for(re int i = 1;i <= n;i ++){
		int tmp = 0;
		for(re int j = i - 1;j >= 1;j --){
			if(a[i] >= a[j]){
				tmp = max(tmp,dp1[j]);
			}
		}
		dp1[i] = tmp + 1;
	}
	for(re int i = n;i > 0;i --){
		int tmp = 0;
		for(re int j = 1;j <= i - 1;j ++){
			if(a[i] >= a[j]){
				tmp = max(tmp,dp2[j]);
			}
		}
		dp2[i] = tmp + 1;
	}
	for(re int i = 1;i < n;i ++){
		ans = max(ans,dp1[i] + dp2[i] - 1);
	}
	cout << (n - ans) << endl;
	return 0;
}