【POJ_2823】Sliding Window

Sliding Window

---

Description

An array of size 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], 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

那么这是什么意思呢？其实这玩意儿在洛谷也有…

没错，就这！

题目描述

有一个长为 nn 的序列 aa，以及一个大小为 kk 的窗口。现在这个从左边开始向右滑动，每次滑动一个单位，求出每次滑动后窗口中的最大值和最小值。
例如：
The array is [1,3,-1,-3,5,3,6,7][1,3,−1,−3,5,3,6,7], and k = 3k=3。

输入格式

输入一共有两行，第一行有两个正整数 n,kn,k。 第二行 nn 个整数，表示序列 aa

输出格式

输出共两行，第一行为每次窗口滑动的最小值
第二行为每次窗口滑动的最大值

输入输出样例

输入

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

输出

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

解题思路

上面哔哔那么多了，那我就长话短说，直接上代码吧：

#include<iostream>
#include<cstdio>
using namespace std;

int n,m,a[1000010];
struct abc{
	int x,p;
}list[1000010];

void node(int t,int xx,int pp)
{
	list[t].x=xx;
	list[t].p=pp;
}

int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	int hd=1,tl=0;
	for(int i=1;i<=n;i++)
	{
		while(hd<=tl&&list[tl].x>=a[i])
			tl--;
		node(++tl,a[i],i);
		while(i-list[hd].p>=m)
			hd++;
		if(i>=m)
			cout<<list[hd].x<<" ";
	}
	cout<<endl;
	hd=1,tl=0;
	for(int i=1;i<=n;i++)
	{
		while(hd<=tl&&list[tl].x<=a[i])
			tl--;
		node(++tl,a[i],i);
		while(i-list[hd].p>=m)
			hd++;
		if(i>=m)
			cout<<list[hd].x<<" ";
	}
	return 0;
}