Submission #1178755

---

Source Code Expand

import java.util.*;

public class Main {
  static int maxLength = 0;
  static int[] c;
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    c = new int[N];
    for(int i = 0; i < N; i++) {
      c[i] = sc.nextInt();
    }
    int[] s = new int[N];
    dfs(0, s);
    System.out.println(N - maxLength);
  }

  public static void dfs(int n, int[] s) {
    if(n == c.length) {
      int a = 0;
      int count = 0;
      int length = 0;
      for(int i = 0; i < c.length; i++) {
        if(s[i] == 1) {
          if(c[i] > a) {
            a = c[i];
            length++;
          } else {
            count++;
            break;
          } 
        }
      }
      if(count == 0) maxLength = Math.max(maxLength, length);
    } else {
      dfs(n + 1, s);
      s[n] = 1;
      dfs(n + 1, s);
    }
  }
}

Submission Info

Judge Result