#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn];
int dp[maxn];
int main(){
int n;
scanf("%d",&n);/*环的最长上升子序列*/
for(int i = 1;i <= n;i++){
scanf("%d",&a[i]);
a[i + n] = a[i];/*----*/
}
dp[0] = 1;
int ans = -1;
for(int k = 1;k <= n;k++){/*----*/
memset(dp,0,sizeof(dp));
for(int i = k;i <= k + n - 1;i++){/*----*/
dp[i] = 1;
for(int j = k;j < i;j++){
if(a[j] < a[i])
dp[i] = max(dp[i],dp[j] + 1);
}
ans = max(ans,dp[i]);
}
}
printf("%d\n",n - ans);
return 0;
}
详细解答look here