-
Notifications
You must be signed in to change notification settings - Fork 0
/
1021.cpp
69 lines (65 loc) · 1.55 KB
/
1021.cpp
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <cstdio>
#include <deque>
using namespace std;
int n,m;
int extract[50];
deque<int> dq;
int solve(){
int res = 0;
for(int i=0;i<m;i++){
/*
for(auto a : dq){
printf("%d ",a);
}
printf("\n");
*/
int size = dq.size();
int front_cnt = 0, back_cnt = 1;
if(dq.front() == extract[i]){
dq.pop_front();
}
else if(dq.back() == extract[i]){
dq.pop_back();
res += 1;
}
else{
while(dq[front_cnt] != extract[i]){
front_cnt += 1;
}
for(auto a=dq.end()-1;;a--){
if(*a == extract[i]) break;
back_cnt += 1;
}
if(front_cnt > back_cnt){
for(int i=0;i<back_cnt;i++){
int cur_back = dq.back();
dq.pop_back();
dq.push_front(cur_back);
}
dq.pop_front();
res += back_cnt;
}
else{
for(int i=0;i<front_cnt;i++){
int cur_front = dq.front();
dq.pop_front();
dq.push_back(cur_front);
}
dq.pop_front();
res += front_cnt;
}
}
}
return res;
}
int main(){
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d",&extract[i]);
}
for(int i=1;i<=n;i++){
dq.push_back(i);
}
printf("%d\n",solve());
return 0;
}