RMQ ST 算法模板

/*
 *  若要求区间最小值，只要把max换成min
 */
 #include <bits/stdc++.h>
using namespace std;
int a[200010]; // 原数组
int RMQ[200010][18]; //预处理数组
int n;
void getRMQ(){
    for (int i = 0;i < n;++i) RMQ[i][0] = a[i];
    for (int j = 1;(1<<j) <= n;++j )
        for (int i = 0;i+(1<<j) <=n;++i )
            RMQ[i][j] = max( RMQ[i][j-1] ,RMQ[i+(1<<(j-1))][j-1] ) ;
}
int querry(int A,int B){
    int k = (int)(log((double)(B+1-A))/log(2.0));
    return max( RMQ[A][k] , RMQ[B+1-(1<<k)][k] );
}