Sliding Window
Time Limit:12000MSMemory Limit:65536K
Total Submissions:46443Accepted:13422
Case Time Limit:5000MS
Description
An array of sizen≤ 106is given to you. There is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:The array is[13-1-35367], andkis 3.
Window positionMinimum valueMaximum value
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 integersnandkwhich are the lengths of the array and the sliding window. There arenintegers 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 31 3 -1 -3 5 3 6 7
Sample Output
-1 -3 -3 -3 3 33 3 5 5 6 7
Source
, Ikki
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;#define maxn 1000000 + 10int a[maxn];int Q[maxn];int p[maxn];int Min[maxn];int Max[maxn];int n, k;void get_min(){int head = 1, tail = 0;//初始条件 队列为空for(int i=1; i<k; i++){while(head <= tail && Q[tail] >= a[i])//进队维护条件tail–;Q[++tail] = a[i];p[tail] = i;}for(int i=k; i<=n; i++){while(head <= tail && Q[tail] >= a[i])tail–;Q[++tail] = a[i];p[tail] = i;while(p[head] < i-k+1)head++;Min[i] = Q[head];}}void get_max(){int head = 1, tail = 0;for(int i=1; i<k; i++){while(head <= tail && Q[tail] <= a[i]) tail–;Q[++tail] = a[i];p[tail] = i;}for(int i=k; i<=n; i++){while(head <= tail && Q[tail] <= a[i]) tail–;Q[++tail] = a[i];p[tail] = i;while(p[head] < i-k+1)head++;Max[i] = Q[head];}}int main(){while(~scanf("%d%d", &n, &k)){for(int i=1; i<=n; i++)scanf("%d", &a[i]);get_min();for(int i=k; i<=n; i++)i==n ? printf("%d\n", Min[i]) : printf("%d ", Min[i]);get_max();for(int i=k; i<=n; i++)i==n ? printf("%d\n", Max[i]) : printf("%d ", Max[i]);}return 0;}
版权声明：本文为博主原创文章，，未经博主允许不得转载。
走一个地方停一个地方。在我心里最美好的就是和你一起老在路上，
