勉强算是正经题解

不正经题解这一块

#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;

int a[N];
int f[N][23];
int n,m;
void solve(){
    cin >> n >> m;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
        f[i][0] = a[i];
    }
    for(int j = 1;j < 23;j++){
        for(int i = 1;i +(1 << j) - 1 <= n;i++){
            f[i][j] = min(f[i][j - 1],f[i + (1 << (j -1))][j - 1]);
        }
    }
    for(int i = 1;i <= m;i++){
        int l,r;
        cin >> l >> r;
        int len = log2(r - l + 1);
        cout << min(f[l][len],f[r - (1 << len) + 1][len]) << " ";
    }
}

signed main(){
    solve();
    return 0;
}