[Algorithm] 최솟값 구하기

[hwangJi-dev]

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

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

N, L = list(map(int, input().split()))
A = list(map(int, input().split()))
queue = deque()

for i in range(N):
    while queue and queue[-1][0] > A[i]:
        queue.pop()
    queue.append((A[i], i))
    if queue[0][1] <= i - L:
        queue.popleft()
    print(queue[0][0], end=' ')