题目:1270. 数列区间最大值
注意:下面注释的地方,会超时,所以能尽量减少运行时间的地方就尽量换掉,比赛的时候最好用scanf,printf,
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+10;
const int mod=100000007;
int n,m;
int pu[N<<2];
int a[N];
int minn=(1<<32)-1;
void pushup(int u){
pu[u]=max(pu[u<<1],pu[u<<1|1]);
}
void build(int u,int l,int r){
if(l>=r){
pu[u]=a[l];
return ;
}
int mid=l+r>>1;
build(u<<1,l,mid);
build(u<<1|1,mid+1,r);
pushup(u);
}
int query(int u,int l,int r,int x,int y){
if(x<=l&&r<=y){
return pu[u];
}
if(x>r||y<l) return minn;
int mid=l+r>>1;
int t=minn;
t=max(t,query(u<<1,l,mid,x,y));
t=max(t,query(u<<1|1,mid+1,r,x,y));
return t;
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
//cin>>a[i];
scanf("%d",&a[i]);
//minn=min(minn,a[i]);
if(minn>a[i]) minn=a[i];
}
build(1,1,n);
int x,y;
for(int i=0;i<m;i++){
//cin>>x>>y;
scanf("%d%d",&x,&y);
//cout<<query(1,1,n,x,y)<<endl;
printf("%d\n",query(1,1,n,x,y));
}
return 0;
}