POJ 2823 Sliding Window(最小堆+最大堆)

昨天写了一下最小堆,,今天再写就容易多了..把数组中连续的k个数字存入堆中,找出最小(大)的,输出...再把序号为i-K+1 的数字从堆中删去.多用了一个数组当指针..多写几次堆,,以后思路更清晰...

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <string>
#define LL long long
#define DB double
#define SF scanf
#define PF printf
#define N 1000009
using namespace std;
int pre[N];
struct nod{
    int p,val;
};
nod qq[N];
bool cmp1(nod &a,nod &b)
{
    return a.val<b.val;
}
bool cmp2(nod &a,nod &b)
{
    return a.val>b.val;
}
struct MI{
    int n;
    void ini(){n=1;}
    void insert(nod &t)
    {
        qq[n++] = t;
        int nw = n-1;
        pre[t.p] = nw;
        while(nw>1)
        {
            if(!cmp1(qq[nw>>1],qq[nw]))
            {
                swap(qq[nw>>1],qq[nw]);
                pre[qq[nw>>1].p] = nw>>1;
                pre[qq[nw].p] = nw;
                nw>>=1;
            }else break;
        }
    }
    nod top(){return qq[1];}
    void pop(int c)
    {
        nod t = qq[--n];
        int tmp =c,k;
        while((tmp<<1)<n)
        {
            k = tmp<<1;
            if(k+1<n&&cmp1(qq[k+1],qq[k]))
            k ++;
            if(cmp1(qq[k],t))
            {
                qq[tmp] = qq[k];
                pre[qq[tmp].p] = tmp;
                tmp = k;
            }else break;
        }qq[tmp] = t;
        pre[qq[tmp].p] = tmp;
    }
} mique;
struct MA{
    int n;
    void ini(){n=1;}
    void insert(nod &t)
    {
        qq[n++] = t;
        int nw = n-1;
        pre[t.p] = nw;
        while(nw>1)
        {
            if(!cmp2(qq[nw>>1],qq[nw]))
            {
                swap(qq[nw>>1],qq[nw]);
                pre[qq[nw>>1].p] = nw>>1;
                pre[qq[nw].p] = nw;
                nw>>=1;
            }else break;
        }
    }
    nod top(){return qq[1];}
    void pop(int c)
    {
        nod t = qq[--n];
        int tmp =c,k;
        while((tmp<<1)<n)
        {
            k = tmp<<1;
            if(k+1<n&&cmp2(qq[k+1],qq[k]))
            k ++;
            if(cmp2(qq[k],t))
            {
                qq[tmp] = qq[k];
                pre[qq[tmp].p] = tmp;
                tmp = k;
            }else break;
        }qq[tmp] = t;
        pre[qq[tmp].p] = tmp;
    }
} maque;
int n,k;
int ansi[N];
int ansa[N];
int re[N];
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    SF("%d%d",&n,&k); if(k>n) k = n;
    for(int i=1;i<=n;i++) SF("%d",&re[i]);
    mique.ini();
    nod e;
    for(int i=1;i<=n;i++)
    {
        e.p = i;e.val = re[i];
        mique.insert(e);
        if(i>=k)
        {
            e = mique.top();
            if(i>k) PF(" ");
            PF("%d",e.val);
            mique.pop(pre[i-k+1]);
        }
    }puts("");
    maque.ini();
    for(int i=1;i<=n;i++)
    {
        e.p = i;e.val = re[i];
        maque.insert(e);
        if(i>=k)
        {
            e = maque.top();
            if(i>k) PF(" ");
            PF("%d",e.val);
            maque.pop(pre[i-k+1]);
        }
    }puts("");
    return 0;
}