Sliding Window Peaks

The watchmen of Codetikki scan the horizon through a window of fixed size k, sliding it across a row of mountain heights. At each position, they record the tallest peak visible in the window. Given an array of integers and a number k, compute the maximum value of each subarray of length k. Output the maximums as space-separated integers in O(n) time.