POJ 2823 Sliding Window 线段树

题意：

给出一个长度为 N 的数组，从左至右求长度为 K 的区域中的最大值和最小值。

思路：

１.线段树维护一个最大值，一个最小值。从左至右循环更新树子叶节点。

２.优先队列.

代码：

优先队列:点击打开链接

线段树：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define ls rt<<1,l,mid
#define rs rt<<1|1,mid+1,r
const int MAXN=1e6+100;
int a[MAXN];int ansmin[MAXN];int ansmax[MAXN];
int tree[MAXN*3];int minn[3*MAXN];int maxn[3*MAXN];
int ppp;int pos;
void push_up(int rt){
    minn[rt]=min(minn[rt<<1|1],minn[rt<<1]);
    maxn[rt]=max(maxn[rt<<1|1],maxn[rt<<1]);
    return ;
}
void build(int rt,int l,int r){
    if(l==r){
        tree[rt]=a[++ppp];
        minn[rt]=tree[rt];
        maxn[rt]=tree[rt];
        return ;
    }
    int mid=(l+r)>>1;
    build(ls);
    build(rs);
    push_up(rt);
    return ;
}
void update(int rt,int l,int r){
    if(l==r){
        tree[rt]=a[++ppp];
        minn[rt]=tree[rt];
        maxn[rt]=tree[rt];
        return ;
    }
    int mid=(l+r)>>1;
    if(pos<=mid)
        update(ls);
    if(mid<pos)
        update(rs);
    push_up(rt);
}
int main()
{
    int n,m;
    while(~scanf("%d %d",&n,&m)){
        memset(tree,0,sizeof(tree));
        memset(a,0,sizeof(a));
        memset(minn,0,sizeof(minn));
        memset(maxn,0,sizeof(maxn));
        //memset(tree,0,sizeof(tree));
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        ppp=-1;
        build(1,1,m);
        ansmin[0]=minn[1];
        ansmax[0]=maxn[1];
        pos=0;
        for(int i=m;i<n;i++){
            pos%=m;
            pos++;
            update(1,1,m);
            ansmin[i-m+1]=minn[1];
            ansmax[i-m+1]=maxn[1];
        }
        for(int i=0;i<n-m;i++)
            printf("%d ",ansmin[i]);
        printf("%d\n",ansmin[n-m]);
        for(int i=0;i<n-m;i++)
            printf("%d ",ansmax[i]);
        printf("%d\n",ansmax[n-m]);
    }
}

Description

An array of size  n ≤ 10  ⁶ 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. 

Input

The input consists of two lines. The first line contains two integers  n and  k which are the lengths of the array and the sliding window. There are  nintegers in the second line. 

Output

There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values. 

Sample Input

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

Sample Output

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