Sliding Window
链接
POJ_2823 Sliding Window
Luogu_1886 滑动窗口 /【模板】单调队列(本题的弱化版)
Description
An array of size n ≤ 1 0 6 n ≤ 10^6 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 ] [1,3, -1,-3,5,3,6,7] [1,3,−1,−3,5,3,6,7], and k k k is 3 3 3.
Window position Minimum value | Maximum | value |
---|---|---|
[1,3,-1], -3,5,3,6,7 | -1 | 3 |
1,[3,-1,-3],5,3,6,7 | -3 | 3 |
1, 3,[-1,-3,5],3,6,7 | -3 | 5 |
1,3,-1,[-3,5,3],6,7 | -3 | 5 |
1,3,-1,-3,[5,3,6],7 | 3 | 6 |
1,3,-1,-3,5,[3,6,7] | 3 | 7 |
Your task is to determine the maximum and minimum values in the sliding window at each position.
题目大意:有一个长为 n n n的序列 a a a,以及一个大小为