-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJ1021.java
More file actions
55 lines (48 loc) · 1.56 KB
/
Copy pathJ1021.java
File metadata and controls
55 lines (48 loc) · 1.56 KB
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
49
50
51
52
53
54
55
package TIL;
import java.util.*;
import java.io.*;
public class J1021 {
static LinkedList<Integer> deque;
public static void main(String[] args) throws IOException {
BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
String[] input = buffer.readLine().split(" ");
int n = Integer.parseInt(input[0]);
int max = Integer.parseInt(input[1]);
deque = new LinkedList<>();
for (int i = 0; i < n; i++) {
deque.offer(i + 1);
}
input = buffer.readLine().split(" ");
int[] result = new int[n];
for (int i = 0; i < max; i++) {
result[i] = Integer.parseInt(input[i]);
}
int cnt=0;
for(int i = 0 ; i < max; i++) {
int index;
if(deque.size() % 2 == 0) {
index = deque.size() / 2 - 1;
}
else {
index = deque.size() / 2;
}
int target = result[i];
int index1 = deque.indexOf(target);
if (index1 <= index) {
for (int j = 0; j <index1; j++) {
int temp = deque.pollFirst();
deque.offerLast(temp);
cnt++;
}
} else {
for (int j = 0; j < deque.size() - index1; j++) {
int temp = deque.pollLast();
deque.offerFirst(temp);
cnt++;
}
}
deque.pollFirst();
}
System.out.println(cnt);
}
}