题意
n 代表矩阵的大小,b代表要查询矩阵的大小,k代表有多少次询问
每次询问给定一个点坐标,以这个坐标为左上角大小为b的矩阵中求最大值和最小值的差
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dmax[251][251][8][8],dmin[251][251][8][8];
int n,m,b;
void rmq()
{
for(int i=0;(1<<i)<=n;i++)
{
for(int j=0;(1<<j)<=n;j++)
{
if(i==0 && j==0)
continue;
for(int k=1;k+(1<<i)-1<=n;k++)
for(int t=1;t+(1<<j)-1<=n;t++)
{
if(i==0)
{
dmax[k][t][i][j]=max(dmax[k][t][i][j-1],dmax[k][t+(1<<(j-1))][i][j-1]);
dmin[k][t][i][j]=min(dmin[k][t][i][j-1],dmin[k][t+(1<<(j-1))][i][j-1]);
}
else if(j==0)
{
dmax[k][t][i][j]=max(dmax[k][t][i-1][j],dmax[k+(1<<(i-1))][t][i-1][j]);
dmin[k][t][i][j]=min(dmin[k][t][i-1][j],dmin[k+(1<<(i-1))][t][i-1][j]);
}
else
{
dmax[k][t][i][j]=max(dmax[k][t][i][j-1],dmax[k][t+(1<<(j-1))][i][j-1]);
dmin[k][t][i][j]=min(dmin[k][t][i][j-1],dmin[k][t+(1<<(j-1))][i][j-1]);
}
}
}
}
}
//本来一维RMQ询问的时候是一个区间,现在变成了一个矩形,所以需要四个角度
int query(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 = dmax[x1][y1][kx][ky];
int m2 = dmax[x2 - (1 << kx) + 1][y1][kx][ky];
int m3 = dmax[x1][y2 - (1 << ky) + 1][kx][ky];
int m4 = dmax[x2 - (1 << kx) + 1][y2 - (1 << ky) + 1][kx][ky];
int maxsum=max(max(m1, m2), max(m3, m4));
int n1 = dmin[x1][y1][kx][ky];
int n2 = dmin[x2 - (1 << kx) + 1][y1][kx][ky];
int n3 = dmin[x1][y2 - (1 << ky) + 1][kx][ky];
int n4 = dmin[x2 - (1 << kx) + 1][y2 - (1 << ky) + 1][kx][ky];
int minsum=min(min(n1,n2),min(n3,n4));
return maxsum-minsum;
}
int main()
{
scanf("%d%d%d",&n,&b,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&dmax[i][j][0][0]);
dmin[i][j][0][0]=dmax[i][j][0][0];
}
rmq();
for(int i=0;i<m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d\n",query(x,y,x+b-1,y+b-1));
}
return 0;
}
参考博客
https://blog.csdn.net/L123012013048/article/details/49688119