ST表模板

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int f[N][100];
int mn[N];
int n, m;
int rmq(int l, int r)
{
    int k = mn[r - l + 1];
    return max(f[l][k], f[r - (1 << k) + 1][k]);
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &f[i][0]);
    }
    for (int j = 1; (1 << j) <= n; j++)
    {
        for (int i = 1; i <= n - (1 << j) + 1; i++)
        {
            f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
        }
    }
    for (int len = 1; len <= n; len++)
    {
        int k = 0;
        while ((1 << (k + 1)) <= len)
        {
            k++;
        }
        mn[len] = k;
    }
    while (m--)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        printf("%d\n", rmq(x, y));
    }

    return 0;
}