Sliding Window(单调队列讲解与例题)

                                                Sliding Window

                                                Time Limit:5000MS  Memory Limit:128000K

Description

An array of size n ≤ 1000000 is given toyou. There is a sliding window of size k which is moving from the very left ofthe array to the very right. You can only see the k numbers in the window. Eachtime the sliding window moves rightwards by one position. Following is anexample: 
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 slid