[슬라이딩 윈도우] 최솟값 찾기 (백준 11003)

from collections import deque
import sys
input = sys.stdin.readline

n, l = map(int, input().split())
mydeque = deque()
now = list(map(int, input().split()))

for i in range(n):
    while mydeque and mydeque[-1][0] > now[i]:
        mydeque.pop()
    mydeque.append((now[i], i))
    if mydeque[0][1] <= i-l:
        mydeque.pop()
    print(mydeque[0][0], end=" ")