RMQ(ST)模板

一维RMQ:

//先调用ST函数预处理，然后调用RMQ查询
const int N = 100010;  
int dp[20][N], a[N];  
void ST(int n)  
{//dp[i][j]:以j为起点，长度为2^i的区间的最值  
    for(int i = 1; i <= n; i++)  
        dp[0][i] = a[i];  
    for(int i = 1; (1<<i) <= n; i++)  
        for(int j = 1; j <= n - (1<<i) + 1; j++)  
            dp[i][j] = max(dp[i-1][j], dp[i-1][j+(1<<(i-1))]);  
}  
int RMQ(int l, int r)  
{  
    int k = log(r - l + 1) / log(2.0);  
    //int k = log2(r - l + 1);
    return max(dp[k][l], dp[k][r-(1<<k)+1]);
}  

二维RMQ:

const int N = 300 + 5, INF = 0x3f3f3f3f;
int a[N][N], dp[N][N][9][9];
//dp[row][col][i][j]:以(row,col)为起点(左上角)，向下扩展2^i，向右扩展2^j长度的矩形内的最值
void ST(int n, int m)
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            dp[i][j][0][0] = a[i][j];
    for(int i = 0; (1<<i) <= n; i++)
        for(int j = 0; (1<<j) <= m; j++)
        {
            if(i == 0 && j == 0) continue;
            for(int row = 1; row <= n - (1<<i) + 1; row++)
                for(int col = 1; col <= m - (1<<j) + 1; col++)
                    if(i == 0) dp[row][col][i][j] = max(dp[row][col][i][j-1], dp[row][col+(1<<(j-1))][i][j-1]);
                    else dp[row][col][i][j] = max(dp[row][col][i-1][j], dp[row+(1<<(i-1))][col][i-1][j]);
        }
}
int RMQ(int x1, int y1, int x2, int y2)
{//查询的时候要查4个点
    int kx = log(x2 - x1 + 1.0) / log(2.0);
    int ky = log(y2 - y1 + 1.0) / log(2.0);
    int t1 = dp[x1][y1][kx][ky];
    int t2 = dp[x2-(1<<kx)+1][y1][kx][ky];
    int t3 = dp[x1][y2-(1<<ky)+1][kx][ky];
    int t4 = dp[x2-(1<<kx)+1][y2-(1<<ky)+1][kx][ky];
    return max(max(t1, t2), max(t3, t4));
}