BZOJ 4552: [Tjoi2016&Heoi2016]排序

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define per(i,r,l) for(int i=r;i>=l;i--)
#define mmt(a,v) memset(a,v,sizeof(a))
#define tra(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
const int N=100000+5;
struct Node{
int l,r,sum,set;
}tr[N<<2];
#define lc o<<1
#define rc o<<1|1
void pushup(int o){
tr[o].sum=tr[lc].sum+tr[rc].sum;
}
void pushdown(int o){
if(tr[o].set!=-1){
tr[lc].set=tr[rc].set=tr[o].set;
tr[lc].sum=(tr[lc].r-tr[lc].l+1)*tr[o].set;
tr[rc].sum=(tr[rc].r-tr[rc].l+1)*tr[o].set;
tr[o].set=-1;
}
}
void update(int o,int a,int b,int f){
int l=tr[o].l,r=tr[o].r;
if(l==a&&b==r)
tr[o].sum=(r-l+1)*f,tr[o].set=f;
else{
pushdown(o);
int mid=l+r>>1;
if(b<=mid)update(lc,a,b,f);
else if(mid<a)update(rc,a,b,f);
else update(lc,a,mid,f),update(rc,mid+1,b,f);
pushup(o);
}
}
int query(int o,int a,int b){
int l=tr[o].l,r=tr[o].r;
if(l==a&&b==r)return tr[o].sum;
else{
pushdown(o);
int mid=l+r>>1;
if(b<=mid)return query(lc,a,b);
else if(mid<a)return query(rc,a,b);
else return query(lc,a,mid)+query(rc,mid+1,b);
}
}
int a
;
void build(int o,int l,int r,int x){
tr[o].l=l;tr[o].r=r;tr[o].set=-1;
if(l==r)tr[o].sum=(a[l]>x);
else{
int mid=l+r>>1;
build(lc,l,mid,x);build(rc,mid+1,r,x);
pushup(o);
}
}
struct Opt{
int k,l,r;
}op
;
int n,m,q;
int check(int x){
build(1,1,n,x);
rep(i,1,m){
int l=op[i].l,r=op[i].r,s=query(1,l,r);
if(op[i].k){
if(s)update(1,l,l+s-1,1);
if(l+s<=r)update(1,l+s,r,0);
}else{
if(s)update(1,r-s+1,r,1);
if(l<=r-s)update(1,l,r-s,0);
}
}
int ans=query(1,q,q);
return ans;
}
int main(){
//freopen("a.in","r",stdin);
scanf("%d%d",&n,&m);
rep(i,1,n)scanf("%d",&a[i]);
rep(i,1,m)scanf("%d%d%d",&op[i].k,&op[i].l,&op[i].r);
scanf("%d",&q);
int l=1,r=n;
while(l<=r){
int mid=l+r>>1;
if(check(mid))l=mid+1;
else r=mid-1;
}
printf("%d\n",r+1);
return 0;
}