SOLUTION INFO
Python · main.py
import sys
from collections import deque
def input():
return sys.stdin.readline().rstrip()
T = int(input())
for i in range(T):
queue = deque()
queue2 = deque()
ct = 1
N,M = map(int, input().split())
arr = list(map(int, input().split()))
for j in range(len(arr)):
queue.append(arr[j])
queue2.append(j)
while True:
if queue[0] == max(queue):
if queue2[0] == M:
print(ct)
break
else:
queue.popleft()
queue2.popleft()
ct += 1
else:
queue.rotate(-1)
queue2.rotate(-1)
SOLUTION DESCRIPTION
풀이 설명
등록된 풀이 설명이 없습니다.