POJ 2019 Cornfields (二维RMQ)

http://poj.org/problem?id=2019
题意：给定一个$N*N$的矩阵和一个整数$B\ (1 <= B <= N)$，$K$次询问，每次询问给出一个位置$x,y$，求以$x,y$为左上角的$B*B$的子矩阵中的最大差值(最大值减最小值)是多少。

二维RMQ的模板题，和一维RMQ的思路一样，只是要扩展到二维，查询是要从四个角进行比较。
具体还是看代码吧QAQ。

#include<iostream>
#include<cstdio>
#include<stack>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
#include<cmath>
#define INF 0x3f3f3f
using namespace std;
int n,k,b,x,y;
short dp1[255][255][10][10],dp2[255][255][10][10],val[255][255];
void ST()
{
    for(int i=0;(1<<i)<=n;i++)
    {
        for(int j=0;(1<<j)<=n;j++)
        {
            if (i == 0 && j == 0) continue;
            for (int row = 1; row + (1 << i) - 1 <= n; row++)
            {
                for (int col = 1; col + (1 << j) - 1 <= n; col++)
                {
                    //当x或y等于0的时候，就相当于一维的RMQ了
                    if(i==0) dp1[row][col][i][j]=max(dp1[row][col][i][j-1],dp1[row][col+(1<<(j-1))][i][j-1]),dp2[row][col][i][j]=min(dp2[row][col][i][j-1],dp2[row][col+(1<<(j-1))][i][j-1]);
                    else if(j==0) dp1[row][col][i][j]=max(dp1[row][col][i-1][j],dp1[row+(1<<(i-1))][col][i-1][j]),dp2[row][col][i][j]=min(dp2[row][col][i-1][j],dp2[row+(1<<(i-1))][col][i-1][j]);
                    else dp1[row][col][i][j]=max(dp1[row][col][i][j-1],dp1[row][col+(1<<(j-1))][i][j-1]),dp2[row][col][i][j]=min(dp2[row][col][i][j-1],dp2[row][col+(1<<(j-1))][i][j-1]);
                }
            }
        }
    }
}

//本来一维RMQ询问的时候是一个区间，现在变成了一个矩形，所以需要四个角度
int Query1(int x1, int y1, int x2, int y2) {
    int kx = 0, ky = 0;
    while (x1 + (1 << (1 + kx)) - 1 <= x2) kx++;
    while (y1 + (1 << (1 + ky)) - 1 <= y2) ky++;
    int m1 = dp1[x1][y1][kx][ky];
    int m2 = dp1[x2 - (1 << kx) + 1][y1][kx][ky];
    int m3 = dp1[x1][y2 - (1 << ky) + 1][kx][ky];
    int m4 = dp1[x2 - (1 << kx) + 1][y2 - (1 << ky) + 1][kx][ky];

    return max(max(m1, m2), max(m3, m4));
}
int Query2(int x1, int y1, int x2, int y2) {
    int kx = 0, ky = 0;
    while (x1 + (1 << (1 + kx)) - 1 <= x2) kx++;
    while (y1 + (1 << (1 + ky)) - 1 <= y2) ky++;
    int m1 = dp2[x1][y1][kx][ky];
    int m2 = dp2[x2 - (1 << kx) + 1][y1][kx][ky];
    int m3 = dp2[x1][y2 - (1 << ky) + 1][kx][ky];
    int m4 = dp2[x2 - (1 << kx) + 1][y2 - (1 << ky) + 1][kx][ky];

    return min(min(m1, m2), min(m3, m4));
}
int main()
{
    memset(dp1,0,sizeof(dp1));
    memset(dp2,INF,sizeof(dp2));
    scanf("%d%d%d",&n,&b,&k);
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            scanf("%hd", &val[i][j]);
            dp1[i][j][0][0] = val[i][j];
            dp2[i][j][0][0] = val[i][j];
        }
    }
    ST();
    while(k--)
    {
        scanf("%d%d",&x,&y);
        printf("%d\n",Query1(x,y,x+b-1,y+b-1)-Query2(x,y,x+b-1,y+b-1));
    }
}