import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static int N;
static int[] arr;
static StringTokenizer stringTokenizer;
static BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws IOException {
initialize();
System.out.println(N - getAnswer());
}
private static int getAnswer() {
int max = 1;
int cnt = 0;
for(int i = 1; i <= N; i++){
if(arr[i] > arr[i-1]){
cnt++;
if(cnt > max)
max = cnt;
}else{
cnt = 1;
}
}
return max;
}
private static void initialize() throws IOException {
N = Integer.parseInt(bufferedReader.readLine());
arr = new int[N+1];
stringTokenizer = new StringTokenizer(bufferedReader.readLine());
for(int i = 0; i < N; i++){
arr[Integer.parseInt(stringTokenizer.nextToken())] = i;
}
}
}
개어렵네;;
'알고리즘' 카테고리의 다른 글
bj13397(구간 나누기2)-매개변수탐색 (0) | 2025.03.20 |
---|---|
bj14500(테트로미노) - DFS, 브루트포스 (0) | 2025.03.15 |
bj2138(전구와 스위치) - 그리디 (0) | 2025.03.10 |
bj2665-미로만들기(다익스트라) (0) | 2025.02.25 |
bj10944 별 찍기(재귀) (2) | 2025.02.09 |