题解 | #合唱队#

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n = 0;
    while (cin >> n)
    {
        vector<int> nums(n, 0);
        for (int i = 0; i < n; ++i)
            cin >> nums[i];

        vector<int> dp1(n, 1), dp2(n, 1);
        for (int i = 1; i < n; ++i)
        {
            for (int j = 0; j < i; ++j)
                if (nums[i] > nums[j])
                    dp1[i] = max(dp1[i], dp1[j] + 1);
        }

        for (int i = n - 2; i >= 0; --i)
        {
            for (int j = n - 1; j > i; --j)
                if (nums[i] > nums[j])
                    dp2[i] = max(dp2[i], dp2[j] + 1);
        }

        int maxValue = dp1[0] + dp2[0];
        for (int i = 1; i < n; ++i)
            maxValue = max(maxValue, dp1[i] + dp2[i]);
        cout << n - maxValue + 1 << endl;
    }
    return 0;
}