洛谷 P3865 ST表

题目链接

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>

typedef long long int ll;
const int  maxn =100000+10;
const int  mod =998244353;
const int INF=0x3f3f3f3f;
using namespace std;
ll pw(ll a,ll b){
    ll ret=1;
    while(b){
        if(b&1)
            ret=ret*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ret;
}
int n,q,st1[maxn][25],st2[maxn][25];
int RMQ1(int l,int r)
{
    int k=0;
    while((1<<(k+1))<=r-l+1) k++;
    return min(st1[l][k],st1[r-(1<<k)+1][k]);
}

int RMQ2(int l,int r)
{
    int k=0;
    while((1<<(k+1))<=r-l+1) k++;
    return max(st2[l][k],st2[r-(1<<k)+1][k]);
}
int main()
{
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&st1[i][0]);
        st2[i][0]=st1[i][0];
    }
    for(int j=1;(1<<j)<=n;j++)
    {
        for(int i=1;i+(1<<j)-1<=n;i++)
        {
            st1[i][j]=min(st1[i][j-1],st1[i+(1<<(j-1))][j-1]);
            st2[i][j]=max(st2[i][j-1],st2[i+(1<<(j-1))][j-1]);
        }
    }
    while(q--)
    {
        int l,r;scanf("%d%d",&l,&r);
        printf("%d\n",RMQ2(l,r));
    }
    return 0;
}