Drop Voicing 最长升序

Drop Voicing

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <deque>
#include <bitset>
#include <cassert>
//#include <unordered_set>
//#include <unordered_map>
#define ll              long long
#define pii             pair<int, int>
#define rep(i,a,b)      for(ll  i=a;i<=b;i++)
#define dec(i,a,b)      for(ll  i=a;i>=b;i--)
#define forn(i, n)      for(ll i = 0; i < int(n); i++)
using namespace std;
int dir[4][2] = { { 1,0 },{ 0,1 } ,{ 0,-1 },{ -1,0 } };
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int inf = 0x3f3f3f3f;
const double pi = 3.14159265358979323846;
const double eps = 1e-6;
const int mod = 1e7 + 7;

inline ll read()
{
    ll x = 0; bool f = true; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') f = false; c = getchar(); }
    while (c >= '0' && c <= '9') x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return f ? x : -x;
}
inline ll gcd(ll m, ll n)
{
    return n == 0 ? m : gcd(n, m % n);
}
void exgcd(ll A, ll B, ll& x, ll& y)
{
    if (B) exgcd(B, A % B, y, x), y -= A / B * x; else x = 1, y = 0;
}



bool prime(int x) {
    if (x < 2) return false;
    for (int i = 2; i * i <= x; ++i) {
        if (x % i == 0) return false;
    }
    return true;
}
inline int qpow(int x, ll n) {
    int r = 1;
    while (n > 0) {
        if (n & 1) r = 1ll * r * x % mod;
        n >>= 1; x = 1ll * x * x % mod;
    }
    return r;
}
/**********************************************************/
const int N = 500 + 5;
int a[N],b[N][N],lis[N];

int main() {
    int n;
    cin >> n;
    rep(i, 1, n)
    {
        cin >> a[i];
    }
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            b[i][(j + i) % n + 1] = a[j];
        }
    }
    int ans = 0;
    rep(i, 1, n)
    {
        int len = 1;
        memset(lis, 0, sizeof(lis));
        lis[1] = b[i][1];
        rep(j, 2, n)
        {
            if (b[i][j] > lis[len])
                lis[++len] = b[i][j];
            else
            {
                int pos = upper_bound(lis + 1, lis + len + 1, b[i][j]) - lis;
                lis[pos] = b[i][j];
            }
        }
        ans = max(ans, len);
    }
    cout << n - ans << endl;
}