P1091 [NOIP2004 提高组] 合唱队形

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#define MAXN 105
typedef long long ll;
using namespace std;
int n;
int h[MAXN];
bool cmp(int a,int b){
	return a>b;
}
int find(int b,int e){
	vector<int>t;
	t.push_back(h[b]);
	if(b>=e){
	for(int i=b-1;i>=e;--i){
		if(h[i]<t.back())
		t.push_back(h[i]);
		else{
			vector<int>::iterator it=lower_bound(t.begin(),t.end(),h[i],cmp);
			t[it-t.begin()]=h[i]; 
		}	
	}
	}
	else{
		for(int i=b+1;i<=e;++i){
		if(h[i]<t.back())
		t.push_back(h[i]);
		else{
			vector<int>::iterator it=lower_bound(t.begin(),t.end(),h[i],cmp);
			t[it-t.begin()]=h[i]; 
		}	
	}
	}
	return (int)t.size();
	
}
int main(){
#ifdef local
freopen("data.in","rb",stdin);
//freopen("data.out","wb",stdout);
#endif
scanf("%d",&n);
for(int i=1;i<=n;++i){
	scanf("%d",&h[i]);
}
int maxp=0;
for(int i=1;i<=n;++i){
	if(maxp<find(i,1)+find(i,n)-1)
	maxp=find(i,1)+find(i,n)-1;
}
cout<<n-maxp;
return 0;
}