这个题要求我们求出每一块边长为N的正方形的最大值,考虑将二维转化成一维,一维数组中求所有长度为N的区间的最值可以用单调队列维护,故对于二维情况,我们可以先求出以i为结尾,前N个数的最值,然后可以求出以j为结尾,j上面N个数的最值,便可以得到以(i,j)为正方形右下角顶点的区域最值
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 1005
int d[maxn][maxn],maxd[maxn][maxn],mind[maxn][maxn];
int n,que[maxn],a,b,temp1[maxn][maxn],temp2[maxn][maxn];
void solve(int n)
{
for (int j=1;j<=b;j++)
{
int r=0,l=1;
for (int i=1;i<=a;i++)
{
while (r>=l&&d[que[r]][j]<=d[i][j]) r--;
que[++r]=i;
while (l<r&&que[l]<=i-n) l++;
temp1[i][j]=d[que[l]][j];
}
}
for (int i=1;i<=a;i++)
{
int r=0,l=1;
for (int j=1;j<=b;j++)
{
while (r>=l&&temp1[i][que[r]]<=temp1[i][j]) r--;
que[++r]=j;
while (l<r&&que[l]<=j-n) l++;
temp2[i][j]=temp1[i][que[l]];
}
}
}
int main()
{
scanf("%d%d%d",&a,&b,&n);
for (int i=1;i<=a;i++)
for (int j=1;j<=b;j++) scanf("%d",&d[i][j]);
solve(n);
for (int i=1;i<=a;i++)
for (int j=1;j<=b;j++)
{
maxd[i][j]=temp2[i][j];
d[i][j]=-d[i][j];
}
solve(n);
for (int i=1;i<=a;i++)
for (int j=1;j<=b;j++)
mind[i][j]=temp2[i][j];
int ans=10e8;
for (int i=1;i<=a;i++)
for (int j=1;j<=b;j++)
{
if (i-n<0||j-n<0) continue;
ans=min(ans,maxd[i][j]+mind[i][j]);
}
printf("%d\n",ans);
return 0;
}