ST表(静态区间查询最值)

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+9;
int f[maxn][20],a[maxn];
int Log[maxn],n;
void get_log()
{
    Log[1] = 0;
    for(int i = 2; i<=n+1; i++)
    {
        Log[i] = Log[i/2]+1;
    }
}
void RMQ()
{
    for(int i = 1; i<=n; i++)
    {
        f[i][0] = a[i];
    }
    for(int j = 1; (1<<j)<=n; 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]);

        }
    }
}
int get_min(int l,int r)
{
    int k = Log[r-l+1];
    return min(f[l][k],f[r-(1<<k)+1][k]);
}


int main()
{
    int i,j,m,l,r;
    scanf("%d %d",&n,&m);
    for(i = 1; i <= n; i++)
    {
        scanf("%d",&a[i]);
    }
    get_log();
    RMQ();
    for(i = 0; i< m; i++)
    {
        scanf("%d %d",&l,&r);
        printf("%d%c",get_min(l,r),i==m-1?'\n':' ');
    }

    return 0;
}