====== 최솟값 찾기 ======

===== 풀이 =====
  * [[ps:덱#monotone queue]] 테크닉을 활용해서 푸는 기본적인 문제. 설명은 링크를 참조.
  * 총 시간 복잡도는 O(n)

===== 코드 =====
<dkpr py>
"""Solution code for "BOJ 11003. 최솟값 찾기".

- Problem link: https://www.acmicpc.net/problem/11003
- Solution link: http://www.teferi.net/ps/problems/boj/11003

Tags: [Monotone queue]
"""

import collections


def main():
    N, L = [int(x) for x in input().split()]  # pylint: disable=unused-variable
    A = [int(x) for x in input().split()]

    answer = []
    deq = collections.deque()
    for left, right in zip([None] * L + A, A):
        while deq and deq[-1] > right:
            deq.pop()
        deq.append(right)
        if deq[0] == left:
            deq.popleft()
        answer.append(deq[0])

    print(*answer)


if __name__ == '__main__':
    main()
</dkpr>

{{tag>BOJ ps:problems:boj:골드_1}}