[백준] [Python] 1021번 회전하는 큐 - 덱

www.acmicpc.net/problem/1021

1021번: 회전하는 큐

 

Python

n, m = map(int, input().split())

dq = [i for i in range(1,n+1)]
arr = list(map(int, input().split()))
cnt = 0
while len(arr) > 0:
    #print(arr[0], dq)
    if dq[0] == arr[0]:
        dq.pop(0)
        arr.pop(0)
    else:
        cnt+=1
        if  len(dq)//2 < dq.index(arr[0]):
            dq.insert(0, dq.pop())
        else:
            dq.append(dq.pop(0))
print(cnt)