题解:本题主要考查线段树的区间求最大值
代码如下:
#include<bits/stdc++.h>
using namespace std;
int n,m,num;
int a[999999],tree[999999];
void build(int p,int l,int r)
{
if(l==r){num++;tree[p]=a[num];}
else
{
int mid=(l+r)/2;
build(p*2,l,mid);
build(p*2+1,mid+1,r);
tree[p]=min(tree[p*2],tree[p*2+1]);
}
}
int ask(int p,int l,int r,int k,int q)//区间求最大值
{
int ans=9999999;
if(k<=l&&q>=r){ans=tree[p];}
else
{
int mid=(l+r)/2;
if(k<=mid)ans=min(ans,ask(p*2,l,mid,k,q));
if(q>mid)ans=min(ans,ask(p*2+1,mid+1,r,k,q));
}
return ans;
}
int main()
{
cin>>n>>m;
int l,r;
for(int i=1;i<=n;i++)cin>>a[i];
build(1,1,n);
for(int i=1;i<=m;i++)
{
cin>>l>>r;
cout<<ask(1,1,n,l,r)<<" ";
}
cin>>n;
return 0;
}
练练手…