题目:理想的正方形
思路:单调队列。
代码:
#include<bits/stdc++.h>
using namespace std;
#define maxn 1000
#define maxk 100
#define read(x) scanf("%d",&x)
struct Pair {
int x,y;
Pair(){}
Pair(int xx,int yy) {x=xx,y=yy;}
};
int n,m,k;
int a[maxn+5][maxn+5];
Pair que1[maxn+5];
int h1,t1;
Pair que2[maxn+5];
int h2,t2;
int mina[maxn+5][maxn+5],maxa[maxn+5][maxn+5];
int main() {
read(n),read(m),read(k);
for(int i=1;i<=n;i++) {
for(int j=1;j<=m;j++) {
read(a[i][j]);
}
}
for(int i=1;i<=n;i++) {
que1[0]=Pair(-200,-1);
que2[0]=Pair(-200,2e9);
t1=h1=t2=h2=0;
for(int j=1;j<=m;j++) {
while(j+1-que1[h1].x>k) h1++;
while(a[i][j]<=que1[t1].y&&t1>=h1) t1--;
que1[++t1]=Pair(j,a[i][j]);
mina[i][j]=que1[h1].y;
while(j+1-que2[h2].x>k) h2++;
while(a[i][j]>que2[t2].y&&t2>=h2) t2--;
que2[++t2]=Pair(j,a[i][j]);
maxa[i][j]=que2[h2].y;
}
}
int ans=1e9;
for(int i=k;i<=n;i++) {
for(int j=k;j<=m;j++) {
int minn=1e9,maxx=0;
for(int u=max(i-k+1,1);u<=i;u++) {
minn=min(minn,mina[u][j]);
maxx=max(maxx,maxa[u][j]);
}
ans=min(ans,maxx-minn);
}
}
printf("%d",ans);
return 0;
}