int a[N];
struct node
{
int l,r,maxx,minx;
}tr[N<<2];
void pushup(int x)
{
tr[x].minx=min(tr[x<<1].minx,tr[x<<1|1].minx);
tr[x].maxx=max(tr[x<<1].maxx,tr[x<<1|1].maxx);
}
void build(int x,int l,int r)
{
tr[x].l=l;tr[x].r=r;
if(l==r){
tr[x].maxx=a[l];
tr[x].minx=a[l];
return;
}
int mid=(l+r)>>1;
build(x<<1,l,mid);
build(x<<1|1,mid+1,r);
pushup(x);
}
int querymin(int x,int l,int r)
{
if(l==tr[x].l&&r==tr[x].r)
{
return tr[x].minx;
}
int mid=(tr[x].l+tr[x].r)>>1;
int res=inf;
if(r<=mid) res=min(res,querymin(x<<1,l,r));
else if(l>mid) res=min(res,querymin(x<<1|1,l,r));
else
{
res=min(res,querymin(x<<1,l,mid));
res=min(res,querymin(x<<1|1,mid+1,r));
}
return res;
}
int querymax(int x,int l,int r)
{
if(l==tr[x].l&&r==tr[x].r)
{
return tr[x].maxx;
}
int mid=(tr[x].l+tr[x].r)>>1;
int res=0;
if(r<=mid) res=max(res,querymax(x<<1,l,r));
else if(l>mid) res=max(res,querymax(x<<1|1,l,r));
else
{
res=max(res,querymax(x<<1,l,mid));
res=max(res,querymax(x<<1|1,mid+1,r));
}
return res;
}
Segment tree template (most value range query)
Guess you like
Origin blog.csdn.net/weixin_43693379/article/details/94362536
Recommended
Ranking