题解 | #合唱队#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        // while (in.hasNextInt()) { // 注意 while 处理多个 case
        //     int a = in.nextInt();
        //     int b = in.nextInt();
        //     System.out.println(a + b);
        // }
        int len = in.nextInt();
        int[] array = new int[len];
        int index = 0;
        while (in.hasNextInt()) {
            array[index] = in.nextInt();
            index++;
        }
        int[] dp1 = new int[len];
        int[] dp2 = new int[len];
        int max = 0;
        for (int l = 0; l < len; l++) {
            dp1[l] = 1;
            dp2[l] = 1;
        }
        for (int i = 0; i < len; i++) {
            for (int j = 0; j <= i; j++) {
                if (array[i] > array[j]) {
                    dp1[i] = Math.max(dp1[i], dp1[j] + 1);
                }
            }
        }
        for (int i = len - 2; i >= 0; i--) {
            for (int k = len - 1; k >= i; k--) {
                if (array[i] > array[k]) {
                    dp2[i] = Math.max(dp2[i], dp2[k] + 1);
                }
            }
        }
        int[] dp = new int[len];
        for (int i = 0; i < len; i++) {
            dp[i] = dp1[i] + dp2[i] - 1;
            max = Math.max(dp[i], max);
            // System.out.println(i + "-" + dp2[i] + "-" + array[i]);
        }
        System.out.print(len - max);
    }
}