P1816 忠诚 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=100010;
int n,m,a[N];
struct node{
int l,r,sum;
};
node tr[N*4];
void pushup(int u){
tr[u].sum=min(tr[u*2].sum,tr[u*2+1].sum);
}
void build(int u,int l,int r){
tr[u]={l,r};
if(l==r){
tr[u].sum=a[l];
return;
}
int mid=(l+r)/2;
build(u*2,l,mid);
build(u*2+1,mid+1,r);
pushup(u);//更新父亲
}
int query(int u,int l,int r){
if(l<=tr[u].l&&tr[u].r<=r) return tr[u].sum;
int mid=(tr[u].l+tr[u].r)/2;
int res=99999999;
if(l<=mid) res=min(res,query(u*2,l,r));
if(r>mid) res=min(res,query(u*2+1,l,r));
return res;
}
void solve()
{
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
build(1,1,n);
while(m--){
int l,r;
cin>>l>>r;
cout<<query(1,l,r)<<" ";
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
solve();
return 0;
}