POJ2823 Sliding Window

POJ2823

筱柒Littleseven
QQ：3534947775

题目链接

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define maxn 1000100
using namespace std;
int n,k,head,tail,q[maxn],a[maxn],maxx[maxn],minn[maxn];
int main()
{
  //cin>>n>>k;
  scanf("%d%d",&n,&k);
  for(int i=1;i<=n;i++) cin>>a[i];
  head=1,tail=0;
  for(int i=1;i<=n;i++)
  {
      while(head<=tail&&i-q[head]+1>k) head++;
      while(head<=tail&&a[q[tail]]>a[i]) tail--;
      q[++tail]=i;
      maxx[i]=a[q[head]];
  }
  //memset(q,0,sizeof q); 
  head=1,tail=0;
  for(int i=1;i<=n;i++)
  {
      while(head<=tail&&i-q[head]+1>k) head++;
      while(head<=tail&&a[q[tail]]<a[i]) tail--;
      q[++tail]=i;
      minn[i]=a[q[head]];
  }
  for(int i=k;i<=n;i++) printf("%d ",maxx[i]); printf("\n");//cout<<maxx[i]<<' '; cout<<endl;
  for(int i=k;i<=n;i++) printf("%d ",minn[i]);//cout<<minn[i]<<' '; cout<<endl;
  return 0;

}