[HEOI2016]排序

来源：互联网发布：辅臣数据库浏览器编辑：程序博客网时间：2024/05/05 18:15

二分答案还是比较容易想到的

对于每一个二分出来的东西，扫一遍初始数组，小于该数赋0，大于等于赋1

于是区间排序变成了区间数0 和区间赋值。

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define rep(j,k,l) for (int j=k;j<=l;++j)#define red(j,k,l) for (int j=k;j>=l;--j)#define N 30005using namespace std;struct _233{        int k,l,fg;    } tr[6*N];int a[N],b[N],c[N],sm[N],pp[N],n,m,T;_233 operator+(_233 a,_233 b){        return (_233){a.k+b.k,a.l+b.l,-1};    }void stree(int k,int l,int r){        if (l==r){                if (pp[l]==0) tr[k].k=1,tr[k].l=0;        else tr[k].k=0,tr[k].l=1;        tr[k].fg=-1;        return;            }    stree(2*k,l,(l+r)>>1);    stree(2*k+1,((l+r)>>1)+1,r);    tr[k]=tr[2*k]+tr[2*k+1];    }int query(int k,int l,int r,int o,int p){        if (r<o||l>p) return 0;    if (l>=o&&r<=p) return tr[k].k;    if (tr[k].fg!=-1){                int kkk=((l+r)>>1)-l+1,lll=r-l+1-kkk;        if (tr[k].fg==0) tr[2*k].k=kkk,tr[2*k].l=0,tr[2*k].fg=0,            tr[2*k+1].k=lll,tr[2*k+1].l=0,tr[2*k+1].fg=0;        else tr[2*k].k=0,tr[2*k].l=kkk,tr[2*k].fg=1,            tr[2*k+1].k=0,tr[2*k+1].l=lll,tr[2*k+1].fg=1;        tr[k].fg=-1;            }    return query(2*k,l,(l+r)>>1,o,p)+query(2*k+1,((l+r)>>1)+1,r,o,p);    }void cg(int k,int l,int r,int o,int p,int poi){        if (r<o||l>p) return;    if (l>=o&&r<=p){                tr[k].k=tr[k].l=0;        if (poi==0) tr[k].k=r-l+1;        else tr[k].l=r-l+1;        tr[k].fg=poi;        return;            }    if (tr[k].fg!=-1){                int kkk=((l+r)>>1)-l+1,lll=r-l+1-kkk;        if (tr[k].fg==0) tr[2*k].k=kkk,tr[2*k].l=0,tr[2*k].fg=0,            tr[2*k+1].k=lll,tr[2*k+1].l=0,tr[2*k+1].fg=0;        else tr[2*k].k=0,tr[2*k].l=kkk,tr[2*k].fg=1,            tr[2*k+1].k=0,tr[2*k+1].l=lll,tr[2*k+1].fg=1;        tr[k].fg=-1;            }    int mid=(l+r)>>1;    if (mid>=o) cg(2*k,l,mid,o,p,poi);    if (mid+1<=p) cg(2*k+1,mid+1,r,o,p,poi);    tr[k]=tr[2*k]+tr[2*k+1];    }int main(){        scanf("%d%d",&n,&m);    rep(i,1,n) scanf("%d",sm+i);    rep(i,1,m) scanf("%d%d%d",c+i,a+i,b+i);    scanf("%d",&T);    int l=0,r=n;    while (l!=r){                int mid=(l+r+1)>>1;        rep(i,1,n) pp[i]=(sm[i]>=mid);        stree(1,1,n);        rep(i,1,m){                        int cl=query(1,1,n,a[i],b[i]);            if (c[i]==0){                                cg(1,1,n,a[i],a[i]+cl-1,0);                cg(1,1,n,a[i]+cl,b[i],1);                            }else{                                cg(1,1,n,a[i],b[i]-cl,1);                cg(1,1,n,b[i]-cl+1,b[i],0);                            }                    }        int cl=1-query(1,1,n,T,T);        if (cl==0) r=mid-1;else l=mid;        //printf("%d %d\n",l,r);            }    printf("%d\n",l);    }

0 0