[백준] [Python] 1966번 프린터 큐 - 큐

https://www.acmicpc.net/problem/1966

1966번: 프린터 큐

 

 

 

Python

from collections import deque

t = int(input())
for i in range(t):
    n,m = map(int,input().split())
    arr = list(map(int,input().split()))
    arr = deque(arr)
    q = deque([i for i in range(n)])
    
    ans = 0
    while q:
        
        x = arr[0]
        xidx = q[0]
        
        if max(list(arr)) == x:
            ans+=1
            if xidx == m:
                print(ans)
                break
            q.popleft()
            arr.popleft()
        else:
            arr.append(arr.popleft())
            q.append(q.popleft())   
        
        #print(ans,xidx,arr)