最大值线段树维护即可。
问题就是一个动态标号。
可以用重量平衡树–替罪羊树来做。
复杂度
O(mlogn+mlogm)
O
(
m
l
o
g
n
+
m
l
o
g
m
)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define M 500010
#define alpha 0.77
ll const MX=1LL<<60;
inline char gc(){
static char buf[1<<16],*S,*T;
if(T==S){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
inline bool get_op(){
char ch=gc();
while(ch!='C'&&ch!='Q') ch=gc();
return ch=='C';
}
int n,m,sz[M],ls[M],rs[M],rt=0,owo=0,*pp,tot,a[M],id[N];ll ppl,ppr;
double w[M];
struct Icefox{
int l,r;
Icefox(int _=0,int __=0){l=_;r=__;}
inline bool friend operator==(Icefox a,Icefox b){return a.l==b.l&&a.r==b.r;}
inline bool friend operator<(Icefox a,Icefox b){
return a.l==b.l?w[a.r]<w[b.r]:w[a.l]<w[b.l];
}
}v[M];
namespace segT{
struct node{
int mx;
}tr[N<<2];
inline int Max(int x,int y){return w[id[x]]>=w[id[y]]?x:y;}
inline void pushup(int p){
tr[p].mx=Max(tr[p<<1].mx,tr[p<<1|1].mx);
}
inline void build(int p,int l,int r){
if(l==r){tr[p].mx=l;return;}int mid=l+r>>1;
build(p<<1,l,mid);build(p<<1|1,mid+1,r);pushup(p);
}inline void change(int p,int l,int r,int x){
if(l==r) return;int mid=l+r>>1;
if(x<=mid) change(p<<1,l,mid,x);
else change(p<<1|1,mid+1,r,x);pushup(p);
}inline int ask(int p,int l,int r,int x,int y){
if(x<=l&&r<=y) return tr[p].mx;int mid=l+r>>1;
if(y<=mid) return ask(p<<1,l,mid,x,y);
if(x>mid) return ask(p<<1|1,mid+1,r,x,y);
return Max(ask(p<<1,l,mid,x,mid),ask(p<<1|1,mid+1,r,mid+1,y));
}
}
inline void pushup(int p){sz[p]=sz[ls[p]]+sz[rs[p]]+1;}
inline int ins(int &p,ll lv,ll rv,Icefox x){
ll mv=lv+rv>>1;
if(!p){p=++owo;v[p]=x;sz[p]=1;w[p]=mv;return p;}
if(v[p]==x) return p;int res;
if(x<v[p]) res=ins(ls[p],lv,mv,x);
else res=ins(rs[p],mv+1,rv,x);pushup(p);
if(max(sz[ls[p]],sz[rs[p]])>=sz[p]*alpha) pp=&p,ppl=lv,ppr=rv;return res;
}
inline void dfs(int &p){
if(ls[p]) dfs(ls[p]);
a[++tot]=p;
if(rs[p]) dfs(rs[p]);
}
inline void build(int &p,int l,int r,ll lv,ll rv){
int mid=l+r>>1;ll mv=lv+rv>>1;p=a[mid];w[p]=mv;ls[p]=rs[p]=0;
if(l<mid) build(ls[p],l,mid-1,lv,mv);
if(r>mid) build(rs[p],mid+1,r,mv+1,rv);pushup(p);
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
segT::build(1,1,n);
while(m--){
bool op=get_op();int x=read(),y=read();
if(op){
int z=read();pp=NULL;id[z]=ins(rt,1,MX,Icefox(id[x],id[y]));
if(pp) tot=0,dfs(*pp),build(*pp,1,tot,ppl,ppr);
segT::change(1,1,n,z);
}else printf("%d\n",segT::ask(1,1,n,x,y));
}return 0;
}