【POJ - 2823 】【Sliding Window】

题目：

An array of size n ≤ 10 6 is given to you. There is a sliding window of size kwhich 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. 

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

Sample Output

-1 -3 -3 -3 3 3
3 3 5 5 6 7

 题意：给我们一个数组，我们有一块挡板，然后在挡板中有空，咱们能够通过空看到一些（k个）数字，然后问我们这个空 从数组前端走到尾端，每次能看到的最小值最大值需要记录一下，最后两行输出。

解题思路：刚上来打算使用单调栈求解，后来发现不能实现它所要求的，然后看了一下题解后，发现居然是手写单调队列。。。

ac代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<stack>
#include<queue>
#define maxn 1000100
using namespace std;
int n,k;
int num[maxn],loc[maxn],que[maxn];
int ans[maxn];
void get_min()
{
	int i;
	int head=1;
	int tail=0;
	for(i=0;i<k-1;i++)
	{
		while(head<=tail&&que[tail]>=num[i])
			--tail;
		que[++tail]=num[i];
		loc[tail]=i;
	}
	for(;i<n;i++)
	{
		while(head<=tail&&que[tail]>=num[i])
			--tail;
		que[++tail]=num[i];
		loc[tail]=i;
		while(loc[head]<i-k+1)
			head++;
		ans[i-k+1]=que[head];
	}
}
void get_max()
{
	int i;
	int head=1;
	int tail=0;
	for(i=0;i<k-1;i++)
	{
		while(head<=tail&&que[tail]<=num[i])
			--tail;
		que[++tail]=num[i];
		loc[tail]=i;
	}
	for(;i<n;i++)
	{
		while(head<=tail&&que[tail]<=num[i])
			--tail;
		que[++tail]=num[i];
		loc[tail]=i;
		while(loc[head]<i-k+1)
			head++;
		ans[i-k+1]=que[head];
	}
}
int main()
{
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		for(int i=0;i<n;i++)	
			scanf("%d",&num[i]);
		get_min();
		for(int i=0;i<n-k;i++)
			printf("%d ",ans[i]);
		printf("%d\n",ans[n-k]);
		memset(ans,0,sizeof(ans));
		get_max();
		for(int i=0;i<n-k;i++)
			printf("%d ",ans[i]);
		printf("%d\n",ans[n-k]);
		memset(ans,0,sizeof(ans));
	}	
}