//单调栈
#include <cstdio>
using namespace std;
int n,k,shu,top1,top2,real1,real2;

struct node
{
	int t,shu;
}a[10000005],b[10000005];

struct poj
{
	int a,b;
}ans[10000005];

int main()
{
	scanf("%d%d",&n,&k);
	top1=top2=real1=real2=0;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&shu);
		while(shu>a[top1].shu&&top1>real1)top1--;
		while(shu<b[top2].shu&&top2>real2)top2--;
		top1++;top2++;
		a[top1].shu=b[top2].shu=shu;
		a[top1].t=b[top2].t=i;
		if(a[real1+1].t<=i-k)real1++;
		if(b[real2+1].t<=i-k)real2++;
		if(i>=k)
		{
			ans[i-k+1].a=a[real1+1].shu;
			ans[i-k+1].b=b[real2+1].shu;
		}
	}
	for(int i=1;i<=n-k+1;i++)printf("%d ",ans[i].b);
	printf("\n");
	for(int i=1;i<=n-k+1;i++)printf("%d ",ans[i].a);
	printf("\n");
	return 0;
}

• Re:用C++，不要用G++！！！ (858) 20040620 2018-12-15 11:06:29
• 谢大神指导 (6) ACAccepted 2018-12-15 21:29:34
• Re:用C++，不要用G++！！！ (13) hntby 2020-02-23 23:28:11