POJ-2823单调队列

/*
G++ TLE了，C++ 5329ms险过。
用G++交了几遍，总觉得没错，也没改就反复交了，傻里傻气的。
再在网路上找了一代码，G++ CE后C++过了，就也试着用C++交自己的代码了，过了。
要不咱研究研究G++和C++好了~~(以上全是废话！)
*/
#include <cstdio>
using namespace std;

const int NN=1000100;

struct node{
    int x,id;
    node(){}
    node(int aa,int bb):x(aa),id(bb){}
};
int n,k;
int front1,rear1,front2,rear2;
node q1[NN],q2[NN];
int s1[NN],s2[NN];

int main()
{
    int x;
    scanf("%d%d",&n,&k);
    if (k>n) k==n;
    front1=front1=1;
    rear1=rear2=0;
    for (int i=1; i<k; i++)
    {
        scanf("%d",&x);
        while (front1<=rear1 && q1[rear1].x>x) rear1--;
        q1[++rear1]=node(x,i);
        while (front2<=rear2 && q2[rear2].x<x) rear2--;
        q2[++rear2]=node(x,i);
    }
    for (int i=k; i<=n; i++)
    {
        scanf("%d",&x);
        while (front1<=rear1 && q1[rear1].x>x) rear1--;
        q1[++rear1]=node(x,i);
        while (front2<=rear2 && q2[rear2].x<x) rear2--;
        q2[++rear2]=node(x,i);
        while (q1[front1].id<=i-k) front1++;
        while (q2[front2].id<=i-k) front2++;
        s1[i]=q1[front1].x; s2[i]=q2[front2].x;
    }
    printf("%d",s1[k]);
    for (int i=k+1; i<=n; i++) printf(" %d",s1[i]);
    printf("\n%d",s2[k]);
    for (int i=k+1; i<=n; i++) printf(" %d",s2[i]);
    printf("\n");
    return 0;
}