ST表

原理：

ST表类似树状数组，线段树这两种算法，是一种用于解决RMQ(Range Minimum/Maximum Query,即区间最值查询)问题的离线算法
与线段树相比，预处理复杂度同为O(nlogn),查询时间上，ST表为O(1),线段树为O(logn)
初始化：

查询：

代码：

/*一维 
#include <bits/stdc++.h>
using namespace std;
const int logn = 21;
const int maxn = 2000005;
long long a[maxn], f[maxn][logn], Logn[maxn];
inline int read() {
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
void pre() {
  	Logn[1] = 0;
  	Logn[2] = 1;
  	for (int i = 3; i <= maxn; i++) {
    	Logn[i] = Logn[i / 2] + 1;
  	}
}
int main() {
  	int n = read(), m = read();
  	for (int i = 1; i <= n; i++) f[i][0] = read();
  	pre();
  	for (int j = 1; j <= logn; j++)
    	for (int i = 1; i + (1 << j) - 1 <= n; i++)
      		f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
  	for (int i = 1; i <= m; i++) {
    	int x = read(), y = read();
    	int s = Logn[y - x + 1];
    	printf("%d\n", max(f[x][s], f[y - (1 << s) + 1][s]));
  	}
  	return 0;
}*/
//二维
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int maxa[maxn][maxn],mina[maxn][maxn],ans=2147483647,logn,a,b,n;
inline int read() {
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
int query(int x, int y){
    int _max=0,_min=0;
    _max=max(maxa[x][y],max(maxa[x+n-(1<<logn)][y+n-(1<<logn)],max(maxa[x+n-(1<<logn)][y],maxa[x][y+n-(1<<logn)])));
    _min=min(mina[x][y],min(mina[x+n-(1<<logn)][y+n-(1<<logn)],min(mina[x+n-(1<<logn)][y],mina[x][y+n-(1<<logn)])));
    return _max-_min;
}
int main() {
  	a = read(), b = read(),n=read();
  	for (int i = 1; i <= a ; i++){
  		for(int j = 1 ; j <= b; j++){
		  	int o = read();
		  	maxa[i][j]=mina[i][j]=o;
		}
	}
  	logn=floor(log2(n));
  	for (int j = 1; j <= logn; j++){
    	for (int i = 1; i + (1 << j) - 1 <= a; i++){
    		for (int k=1;k+(1<<j)-1<=b;k++){
      			maxa[i][k]=max(maxa[i][k],max(maxa[i + (1 << (j-1))][k + (1 << (j-1) )],max(maxa[i][k + (1 << (j-1) )],maxa[i + (1 << (j-1))][k])));
      			mina[i][k]=min(mina[i][k],min(mina[i + (1 << (j-1))][k + (1 << (j-1) )],min(mina[i][k + (1 << (j-1) )],mina[i + (1 << (j-1))][k])));
      		}
      	}
    } 
  	for(int i=1;i<=a-n+1;i++)
  		for(int j=1;j<=b-n+1;j++)
  			ans=min(ans,query(i,j));
  	printf("%d",ans);
  	return 0;
}