一维和二维ST模板

void init(){
    for (int i = ; i < n; i++) st[i][] = a[i];
    for (int j = ; ( << j) <= n; j++){
        for (int i = ; i + ( << j) -  < n; i++){
            st[i][j] = min(st[i + ( << (j-))][j - ], st[i][j - ]);
        }
    }
}

inline int query(int l, int r){
    int len = r - l + ;
    int k = ;
    while (( << (k + )) <= len) k++;
    return min(st[l][k], st[r - ( << k) + ][k]);
}

二维：

定义dp(i, j, k, L)表示以(i,j)为左上角，宽度为(2^k, 2^L)的区间内的某个数值

int dp[maxn][maxn][][], dp2[maxn][maxn][][];

void init_st(){
    for (int i = ; ( << i) <= n; i++){
        for (int j = ; ( << j) <= n; j++){
            if (i ==  && j == ) continue;
            for (int x = ; x + ( << i) -  <= n; x++){
                for (int y = ; y + ( << j) -  <= n; y++){
                    if (i == ) {
                        dp[x][y][i][j] = min(dp[x][y][i][j - ], dp[x][y + ( << (j - ))][i][j - ]);
                        dp2[x][y][i][j] = max(dp2[x][y][i][j - ], dp2[x][y + ( << (j - ))][i][j - ]);
                    }
                    else {
                        dp[x][y][i][j] = min(dp[x][y][i - ][j], dp[x + ( << (i - ))][y][i - ][j]);
                        dp2[x][y][i][j] = max(dp2[x][y][i - ][j], dp2[x + ( << (i - ))][y][i - ][j]);
                    }
                }
            }
        }
    }
}

int query(int x, int y, int X, int Y){
    int maxi = , mini = 1e8;
    int k1 = , k2 = ;
    while ( << ( + k1) <= X - x) k1++;
    while ( << ( + k2) <= Y - y) k2++;
    maxi = max(maxi, max(dp2[x][y][k1][k2], dp2[X - ( << k1) + ][y][k1][k2]));
    maxi = max(maxi, max(dp2[x][Y - ( << k2) + ][k1][k2], dp2[X - ( << k1) + ][Y - ( << k2) + ][k1][k2]));

    mini = min(mini, min(dp[x][y][k1][k2], dp[X - ( << k1) + ][y][k1][k2]));
    mini = min(mini, min(dp[x][Y - ( << k2) + ][k1][k2], dp[X - ( << k1) + ][Y - ( << k2) + ][k1][k2]));
    //printf("maxi = %d mini = %d\n", maxi, mini);
    return maxi - mini;
}