单调队列典型题
An array of size n ≤ 10 6 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 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.
?
#include
#include
#include
#include
#include
#include
#include
#include
?
??
?