#include<iostream>
#include<climits>
using namespace std;
const int N = 1e5+10;
int w[N];
int n,m;
struct Node{
int l,r;
int maxv;
}tr[N * 4];
void pushup(int u){
tr[u].maxv = max(tr[u<<1].maxv,tr[u<<1|1].maxv);
}
void build(int u,int l,int r){
if(l==r) tr[u] = {l,r,w[r]};
else {
tr[u] = {l,r};
int mid=l+r>>1;
if(l<=mid) build(u<<1,l,mid);
if(r>mid) build(u<<1|1,mid+1,r);
pushup(u);
}
}
int query(int u,int l,int r){
if(l<=tr[u].l && r>=tr[u].r) return tr[u].maxv;
int mid = tr[u].l+tr[u].r>>1;
int res=INT_MIN;
if(l<=mid) res = max(res,query(u<<1,l,r));
if(r>mid) res = max(res,query(u<<1|1,l,r));
return res;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&w[i]);
build(1,1,n);
while(m--){
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",query(1,a,b));
}
}
线段树求解数列区间的最大值(c++实现)
最新推荐文章于 2024-06-02 23:20:25 发布