#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
const int N = 50010,M=4*N,INF=1e9;
int n,m;
int w[N];
struct Node{
int l,r;
multiset<int> s;
}tr[M];
void build(int u,int l,int r)
{
tr[u]={l,r};
tr[u].s.insert(INF),tr[u].s.insert(-INF);
for(int i=l;i<=r;i++)tr[u].s.insert(w[i]);
if(l==r)return;
int mid=l+r>>1;
build(u<<1,l,mid),build(u<<1|1,mid+1,r);
}
void modify(int u,int idx,int a)
{
tr[u].s.erase(tr[u].s.find(w[idx]));
tr[u].s.insert(a);
if(tr[u].l==tr[u].r)return;
int mid=tr[u].l+tr[u].r>>1;
if(idx<=mid)modify(u<<1,idx,a);
else modify(u<<1|1,idx,a);
}
int query(int u,int l ,int r,int a)
{
if(l<=tr[u].l&&tr[u].r<=r)
{
auto it=tr[u].s.lower_bound(a);
--it;
return *it;
}
int mid=tr[u].l+tr[u].r>>1,res=-INF;
if(l<=mid)res=max(res,query(u<<1,l,r,a));
if(r>mid)res=max(res,query(u<<1|1,l,r,a));
return res;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>w[i];
build(1,1,n);
while(m--)
{
int op,a,b,c;
cin>>op;
if(op==1)
{
cin>>a>>b;
modify(1,a,b);
w[a]=b;
}
else {cin>>a>>b>>c;cout<<query(1,a,b,c)<<endl;}
}
}
线段树套平衡树
最新推荐文章于 2022-01-23 18:01:00 发布