P1440 Minimum in the Previous m Elements

Given a sequence with $n$ terms, for each term, find the minimum within the interval consisting of the previous $m$ numbers before it. If there are fewer than $m$ previous numbers, start from the first number. If there are no previous numbers, output $0$.

The first line contains two integers $n$, $m$. The second line contains $n$ positive integers, which form the given sequence $a_i$.

Output $n$ lines, one integer per line. The $i$-th number is the minimum among the $m$ numbers before $a_i$ in the sequence.

For $100\%$ of the testdata, it is guaranteed that $1 \le m \le n \le 2\times 10^6$, $1 \le a_i \le 3\times 10^7$. Translated by ChatGPT 5