Description
有一个ab的整数组成的矩阵,现请你从中找出一个nn的正方形区域,使得该区域所有数中的最大值和最小值
的差最小。
Input
第一行为3个整数,分别表示a,b,n的值第二行至第a+1行每行为b个非负整数,表示矩阵中相应位置上的数。每
行相邻两数之间用一空格分隔。
100%的数据
2<=a,b<=1000,n<=a,n<=b,n<=1000
Output
仅一个整数,为ab矩阵中所有“nn正方形区域中的最大整数和最小整数的差值”的最小值。
Sample Input
5 4 2
1 2 5 6
0 17 16 0
16 17 2 1
2 10 2 1
1 2 2 2
Sample Output
1
经典二维单调队列模板题
先维护
x
m
i
n
n
[
i
]
[
j
]
/
x
m
a
x
n
[
i
]
[
j
]
xminn[i][j] / xmaxn[i][j]
xminn[i][j]/xmaxn[i][j] :第
i
i
i行 第
j
−
n
+
1
j
j - n + 1 ~ j
j−n+1 j 中元素的最小/最大值
再维护
x
m
i
n
n
[
i
]
[
j
]
/
x
m
a
x
n
[
i
]
[
j
]
xminn[i][j] / xmaxn[i][j]
xminn[i][j]/xmaxn[i][j] 中每一列的长度为n的区间最小/最大值
从而通过两次一维单调队列将
n
∗
n
n*n
n∗n的正方形的最大/最小值转移到了该正方形的右下角
ACODE:
#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MX = 2e3 +7;
int xmaxn[MX][MX];
int xminn[MX][MX];
int ymaxn[MX][MX];
int yminn[MX][MX];
int mp[MX][MX];
int que1[MX];//up min
int que2[MX];//down max
int main(){
int n,m,k;
int res = INF;
scanf("%d%d%d",&n,&m,&k);
for(int i = 1;i <= n;++i){
for(int j = 1;j <= m;++j){
scanf("%d",&mp[i][j]);
}
}
for(int i = 1;i <= n;++i){
int head1 = 0,head2 = 0;
int tail1 = 0,tail2 = 0;
for(int j = 1;j <= m;++j){
while(head1 < tail1 && mp[i][j] < mp[i][que1[tail1-1]]) tail1--;
while(head2 < tail2 && mp[i][j] > mp[i][que2[tail2-1]]) tail2--;
que1[tail1++] = j;
que2[tail2++] = j;
while(head1 < tail1 && que1[tail1 - 1] - que1[head1] + 1 > k) head1++;
while(head2 < tail2 && que2[tail2 - 1] - que2[head2] + 1 > k) head2++;
xminn[i][j] = mp[i][que1[head1]];
xmaxn[i][j] = mp[i][que2[head2]];
}
}
for(int j = k;j <= m;++j){
int head1 = 0,head2 = 0;
int tail1 = 0,tail2 = 0;
for(int i = 1;i <= n;++i){
while(head1 < tail1 && xminn[i][j] < xminn[que1[tail1-1]][j]) tail1--;
while(head2 < tail2 && xmaxn[i][j] > xmaxn[que2[tail2-1]][j]) tail2--;
que1[tail1++] = i;
que2[tail2++] = i;
while(head1 < tail1 && que1[tail1 - 1] - que1[head1] + 1 > k) head1++;
while(head2 < tail2 && que2[tail2 - 1] - que2[head2] + 1 > k) head2++;
yminn[i][j] = xminn[que1[head1]][j];
ymaxn[i][j] = xmaxn[que2[head2]][j];
if(i < k) continue;
res = min(res,ymaxn[i][j] - yminn[i][j]);
}
}
printf("%d\n",res);
return 0;
}