题解 | #合唱队#

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            int num = scanner.nextInt();
            int[] intarr = new int[num];
            for (int i = 0; i < num; i++) {
                intarr[i] = scanner.nextInt();
            }

            int[] left = new int[num];
            int[] right = new int[num];
            left[0]=1;
            right[num-1]=1;

            for (int i = 0; i < num; i++) {
                left[i]=1;
                for (int j = 0; j < i; j++) {
                    if (intarr[i]>intarr[j]) {
                        left[i] = Math.max(left[j]+1, left[i]);
                    }
                }
            }

            for (int i = num-1; i >= 0; i--) {
                right[i]=1;
                for (int j = num-1; j > i; j--) {
                    if (intarr[i]>intarr[j]) {
                        right[i] = Math.max(right[j]+1, right[i]);
                    }
                }
            }

            int[] result = new int[num];

            for (int i = 0; i < num; i++) {
                result[i] = left[i] + right[i] - 1 ;
            }

            int maxDis = 1;
            for (int i = 0; i < num; i++) {
                maxDis = Math.max(result[i], maxDis);
            }


            System.out.println(num-maxDis);

        }

    }

}