ST表-RMQ问题

注意区间端点取值问题！！！

是在不行自己先写下来 然后自己算一下

$len=r-l+1$

$l=r-len+1$

#include<bits/stdc++.h>
using namespace std;
int n,m,a[100005],f[100005][20],x,y;
void ST_prework(){
    int t=log(n)/log(2);
    for (int j=1;j<=t;j++)
        for (int i=1;i<=n-(1<<j)+1;i++) //len=r-l+1 l=r-len+1
    f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);//第一段右端点l+len-1 第二段左端点l+len     
}
int ST_query(int l,int r){
    int k=log(r-l+1)/log(2);
    return max(f[l][k],f[r-(1<<k)+1][k]);//l=r-len+1 已知右端点 
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        f[i][0]=a[i]; 
    }
    ST_prework();
    for (int i=1;i<=m;i++) {
        scanf("%d%d",&x,&y);
        printf("%d\n",ST_query(x,y));
    }
    return 0;
} 

转载于:https://www.cnblogs.com/Hiraeth-dh/p/10673404.html