P1816 忠诚

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=100100;
ll minn[N<<2];
ll a[N];
ll n,m;
ll cnt;
void build(ll rt,ll l,ll r){
    if(l==r){
        ++cnt;
        minn[rt]=a[cnt];
        //return ;
    }else {
        ll mid = (l+r)>>1;
        build(rt*2,l,mid);
        build(rt*2+1,mid+1,r);
        minn[rt]=min(minn[rt*2],minn[rt*2+1]);
    }
    //return ;
}

ll get(ll rt,ll l,ll r,ll zuo,ll you){
    ll ans=1e8;
    if(zuo<=l&&you>=r){
        return ans=minn[rt];
    } else {
        ll mid = (l+r)>>1;
        if(zuo<=mid){
            ans=min(ans,get(rt*2,l,mid,zuo,you));
        }
        if(you>mid){
            ans=min(ans,get(rt*2+1,mid+1,r,zuo,you));
        }
    }
    return ans;
}

int main(){
    scanf("%lld%lld",&n,&m);
    for(ll i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    build(1,1,n);
    for(ll i=1;i<=m;i++){
        ll a,b;
        scanf("%lld%lld",&a,&b);
        printf("%lld ",get(1,1,n,a,b));
    }
    return 0;
}