-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path241119-1021.java
48 lines (43 loc) · 1.47 KB
/
241119-1021.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
int arr[] = new int[M];
st = new StringTokenizer(br.readLine());
for (int i = 0; i < M; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
LinkedList<Integer> dq = new LinkedList<>();
for (int i = 1; i <= N; i++) {
dq.add(i);
}
int answer = 0;
for (int i = 0; i < M; i++) {
int targetIdx = dq.indexOf(arr[i]);
int midIdx = dq.size() / 2;
if (dq.size() % 2 == 0) {
midIdx = midIdx - 1;
}
if (targetIdx <= midIdx) {
for (int j = 0; j < targetIdx; j++) {
dq.addLast(dq.pollFirst());
answer++;
}
} else {
for (int j = dq.size() - 1; j >= targetIdx; j--) {
dq.addFirst(dq.pollLast());
answer++;
}
}
dq.pollFirst();
}
System.out.print(answer);
}
}