POJ 2823 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.

---

【题目分析】
方法一：线段树。
方法二：ST算法（会MLE）
方法三：单调队列（请用c++提交我的代码，G++会TLE。如果想通过，请多开一个数组，把两个过程放在一起。（我懒得写了））

---

【代码】
一、线段树

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int N=1000010;
const int INF=0x3f3f3f3f;

#define L(rt) (rt<<1)
#define R(rt) (rt<<1|1)

struct Tree{
    int l,r;
    int minx,maxx;
}tree[N<<2];

void build(int L,int R,int rt){
    tree[rt].l=L;
    tree[rt].r=R;
    if(tree[rt].l==tree[rt].r){
        scanf("%d",&tree[rt].minx);
        tree[rt].maxx=tree[rt].minx;
        return ;
    }
    int mid=(L+R)>>1;
    build(L,mid,L(rt));
    build(mid+1,R,R(rt));
    tree[rt].minx=min(tree[L(rt)].minx,tree[R(rt)].minx);
    tree[rt].maxx=max(tree[L(rt)].maxx,tree[R(rt)].maxx);
}

int minx,maxx;

void QueMin(int L,int R,int rt){
    if(L<=tree[rt].l && tree[rt].r<=R){
        minx=min(minx,tree[rt].minx);
        return ;
    }
    int mid=(tree[rt].l+tree[rt].r)>>1;
    if(R<=mid)
        QueMin(L,R,L(rt));
    else if(L>=mid+1)
        QueMin(L,R,R(rt));
    else{
        QueMin(L,mid,L(rt));
        QueMin(mid+1,R,R(rt));
    }
}

void QueMax(int L,int R,int rt){
    if(L<=tree[rt].l && tree[rt].r<=R){
        maxx=max(maxx,tree[rt].maxx);
        return ;
    }
    int mid=(tree[rt].l+tree[rt].r)>>1;
    if(R<=mid)
        QueMax(L,R,L(rt));
    else if(L>=mid+1)
        QueMax(L,R,R(rt));
    else{
        QueMax(L,mid,L(rt));
        QueMax(mid+1,R,R(rt));
    }
}

int main(){
    int n,k;
    while(~scanf("%d%d",&n,&k)){
        build(1,n,1);
        int m=n-k,r;
        for(int l=1;l<=m;l++){
            r=l+k-1;
            minx=INF;
            QueMin(l,r,1);
            printf("%d ",minx);
        }
        minx=INF;
        QueMin(n-k+1,n,1);
        printf("%d\n",minx);

        for(int l=1;l<=m;l++){
            r=l+k-1;
            maxx=-INF;
            QueMax(l,r,1);
            printf("%d ",maxx);
        }
        maxx=-INF;
        QueMax(n-k+1,n,1);
        printf("%d\n",maxx);
    }
    return 0;
}

二、

#include <cstdio>
#include <cmath>
int mi[1000001][17],mx[1000001][17],a[1000001],n,q,l,r,k;
inline int max(int a,int b){return a>b?a:b;}
inline int min(int a,int b){return a>b?b:a;}
inline void init()
{
    int m=(int)((log(n*1.0))/log(2.0));
    for (int i=1;i<=n;++i) mi[i][0]=mx[i][0]=a[i];
    for (int i=1;i<=m;++i)
        for (int j=1;j<=n;++j)
        {
            mi[j][i]=mi[j][i-1],mx[j][i]=mx[j][i-1];
            if(j+(1<<(i-1))<=n) mx[j][i]=max(mx[j][i],mx[j+(1<<(i-1))][i-1]);
            if(j+(1<<(i-1))<=n) mi[j][i]=min(mi[j][i],mi[j+(1<<(i-1))][i-1]);
        }
}
inline int ri(int l,int r)
{
    int m=(int)(log((r-l+1)*1.0)/log(2.0));
    return min(mi[l][m],mi[r-(1<<m)+1][m]);
}
inline int rx(int l,int r)
{
    int m=(int)(log((r-l+1)*1.0)/log(2.0));
    return max(mx[l][m],mx[r-(1<<m)+1][m]);
}
int main()
{
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;++i) scanf("%d",&a[i]);
    init();
    for (int i=k;i<=n;++i)
        printf("%d ",ri(i-k+1,i));
        printf("\n");
    for (int i=k;i<=n;++i)
        printf("%d ",rx(i-k+1,i));printf("\n");
}

三、

#include<cstdio>
struct point{
    int v,low;
}q[1000001];
int n,k,minn[1000001],maxx[1000001],a[1000001];
int main()
{
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;++i) scanf("%d",&a[i]);
    int l=1,r=0;
    for (int i=1;i<=n;++i)
    {
        while(l<=r&&a[i]<=q[r].v) r--; 
        q[r+1].v=a[i];q[++r].low=i;
        while (l<=r&&q[r].low-q[l].low>=k) l++;
        if (i>=k) printf("%d ",q[l].v);
    }
    printf("\n");
    l=1,r=0;
    for (int i=1;i<=n;++i)
    {
        while(l<=r&&a[i]>=q[r].v) r--; 
        q[r+1].v=a[i];q[++r].low=i;
        while (l<=r&&q[r].low-q[l].low>=k) l++;
        if (i>=k) printf("%d ",q[l].v);
    }
    printf("\n");

}