Sliding Window Minimum
Print the minimum of every contiguous window of size K, left to right.
Input: the first line has N and K; the second line has N integers.
Output: N−K+1 integers: the window minima.
Constraints:
- 1 ≤ K ≤ N ≤ 105
- −109 ≤ ai ≤ 109
Sample Tests
Input 1
8 3 1 3 -1 -3 5 3 6 7
Output 1
-1 -3 -3 -3 3 3
Input 2
1 1 5
Output 2
5
Discussion (opens after you solve — no spoilers before)
No comments yet.