a146: Sliding Window
Tags : Heap(X) ST(X) 單調隊列
Accepted rate : 63人/73人 ( 86% ) [非即時]
評分方式:
Strictly

最近更新 : 2011-06-09 21:14

Content
An array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
The array is [1 3 -1 -3 5 3 6 7], and k is 3.
Window positionMinimum valueMaximum value
[1  3  -1] -3  5  3  6  7 -13
 1 [3  -1  -3] 5  3  6  7 -33
 1  3 [-1  -3  5] 3  6  7 -35
 1  3  -1 [-3  5  3] 6  7 -35
 1  3  -1  -3 [5  3  6] 7 36
 1  3  -1  -3  5 [3  6  7]37

Your task is to determine the maximum and minimum values in the sliding window at each position.

Input
The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
Output
There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
Sample Input
8 3
1 3 -1 -3 5 3 6 7
7 3
10 -26 89 80 27 84 73
Sample Output
-1 -3 -3 -3 3 3
3 3 5 5 6 7
-26 -26 27 27 27
89 89 89 84 84
測資資訊:
記憶體限制: 512 MB
公開 測資點#0 (100%): 2.0s , <50M
Hint :
// 輸入改成多筆測資
Tags:
Heap(X) ST(X) 單調隊列
出處:
POJ 2823 [管理者:
morris1028 (碼畜)
]


ID User Problem Subject Hit Post Date
沒有發現任何「解題報告」