st表模板

#include <bits/stdc++.h>
#define ll long long
#define endl '\n' 
using namespace std;
const int maxn = 5e5 + 5;
int f[maxn][20];
int n, q;
int query(int l, int r) {
	int k1 = r - l + 1;
	int k = log2(k1);
	return min(f[l][k], f[r - (1 << k) + 1][k]);
}
int main () {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> q;	
	for (int i = 1; i <= n; i++) cin >> f[i][0];
	for (int j = 1; j < 20; j++) {
		for (int i = 1; i <= n; i++) {
			if(i + (1 << j) - 1 > n) continue;
			f[i][j] = min(f[i][j - 1], f[i + (1 << j - 1)][j - 1]);
		}
	}
	while (q--) {
		int x, y;
		cin >> x >> y;
		cout << query(x, y) << ' ';
	}
}