分析:
我们先二分答案,然后把所有大于等于mid 的值设为1,小于mid的值设为0,用线段树做log次01排序最后根据q位置上的值调整l和r即可
Code:
#include<bits/stdc++.h>
#define ls tr[k].l
#define rs tr[k].r
#define mid ((ls+rs)>>1)
using namespace std;
inline int read(){
int res=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
return res*f;
}
const int N=100005;
int n,m,v[N],q,a[N];
int op[N],l[N],r[N];
namespace segtree{
struct seg{int l,r,sum,cov;}tr[N<<2];
inline void pushup(int k) {tr[k].sum=tr[k<<1].sum+tr[k<<1|1].sum;}
inline void pushcov(int k,int v) {tr[k].cov=v;tr[k].sum=(rs-ls+1)*v;}
inline void pushdown(int k){
if(tr[k].cov!=-1) {
pushcov(k<<1,tr[k].cov);pushcov(k<<1|1,tr[k].cov);
tr[k].cov=-1;
}
}
inline void build(int k,int l,int r){
ls=l,rs=r,tr[k].cov=-1;
if(l==r) {tr[k].sum=a[l];return;}
build(k<<1,l,mid);build(k<<1|1,mid+1,r);
pushup(k);
}
inline void modify(int k,int ql,int qr,int val){
if(ql>rs || qr<ls) return;
if(ql<=ls && rs<=qr) return pushcov(k,val);
pushdown(k);
if(qr<=mid) modify(k<<1,ql,qr,val);
else if(ql>mid) modify(k<<1|1,ql,qr,val);
else modify(k<<1,ql,mid,val),modify(k<<1|1,mid+1,qr,val);
pushup(k);
}
inline int query(int k,int ql,int qr){
if(ql>rs || qr<ls) return 0;
if(ql<=ls && rs<=qr) return tr[k].sum;
pushdown(k);
if(qr<=mid) return query(k<<1,ql,qr);
else if(ql>mid) return query(k<<1|1,ql,qr);
else return query(k<<1,ql,mid)+query(k<<1|1,mid+1,qr);
}
}
namespace divide{
using namespace segtree;
int down,up,midd;
inline int check(int x){
for(int i=1;i<=n;i++) a[i]=(v[i]>=x);
build(1,1,n);
for(int i=1;i<=m;i++){
int num=query(1,l[i],r[i]);
if(!op[i]) modify(1,r[i]-num+1,r[i],1),modify(1,l[i],r[i]-num,0);
else modify(1,l[i],l[i]+num-1,1),modify(1,l[i]+num,r[i],0);
}
return query(1,q,q);
}
inline void div(){
down=1,up=n;
while(down<=up){
midd=(down+up)>>1;
if(check(midd)) down=midd+1;
else up=midd-1;
}
if(check(up)) cout<<up;
else cout<<down;
}
inline void work(){
n=read();m=read();
for(int i=1;i<=n;i++) v[i]=read();
for(int i=1;i<=m;i++) op[i]=read(),l[i]=read(),r[i]=read();
q=read();
div();
}
}
int main(){
divide::work();
return 0;
}