poj2823 Sliding Window 单调队列

题目

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.

给定一个数列，从左至右输出每个长度为m的数列段内的最小数和最大数。
数列长度：N<=10^6，m<=N
8 3
1 3 -1 -3 5 3 6 7

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

题解

用，单调队列

代码

#include <cstdio>

using namespace std;

int n,m,h,t;
int a[1000010],f[1000010];

void readin(){
	char c;
	c=getchar();
	while ((c<'0'||c>'9')&&(c-'0'!='-'-'0')) c=getchar();
	int i=0,b=1;
	int x=0;
	while ((c>='0'&&c<='9')||(c-'0'==' '-'0')||(c-'0'=='-'-'0')){
		if (c-'0'==' '-'0') a[++i]=x*b,x=0,b=1; else
		if (c-'0'=='-'-'0') b=-1; else x=x*10+c-'0';
		c=getchar();
	}
	a[++i]=x*b;
}

void writeln(int x){
	if (x/10) writeln(x/10);
	putchar(x%10+'0');
}

void write(int x){
	if (x==0) {putchar('0');putchar(' ');return;}
	if (x<0) putchar('-'),x*=-1;
	writeln(x);
	putchar(' ');
}

int main(){
	scanf("%d%d",&n,&m);
	readin();
	h=1;
	for (int i=1;i<m;i++){
		while ((t>=1)&&(a[i]<=a[f[t]])){
			t--;
		}
		f[++t]=i;
	}
	for (int i=m;i<n;i++){			
		while ((t>=h)&&(a[i]<=a[f[t]])) t--;
		f[++t]=i;
		if (f[h]==i-m) h++;
		write(a[f[h]]);		
	}
	while ((t>=h)&&(a[n]<=a[f[t]])) t--;
	f[++t]=n;
	if (f[h]==n-m) h++;
	printf("%d",a[f[h]]);	
	printf("\n");
	h=1;t=0;
	for (int i=1;i<m;i++){
		while ((t>=1)&&(a[i]>=a[f[t]])){
			t--;
		}
		f[++t]=i;
	}
	for (int i=m;i<n;i++){
		while ((t>=h)&&(a[i]>=a[f[t]])) t--;
		f[++t]=i;
		if (f[h]==i-m) h++;
		write(a[f[h]]);
	}
	while ((t>=h)&&(a[n]>=a[f[t]])) t--;
	f[++t]=n;
	if (f[h]==n-m) h++;
	printf("%d",a[f[h]]);
}

众人皆作我独死

何为作死？
此作死最高境界