一道简单的二维RMQ,
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<vector>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<algorithm>
#include<complex>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define nn 1010
#define mm 10
#define ll long long
ll max4(ll b,ll c,ll d,ll e)
{
b=max(b,c);
c=max(d,e);
b=max(b,c);
return b;
}
ll min4(ll b,ll c,ll d,ll e)
{
b=min(b,c);
c=min(d,e);
b=min(b,c);
return b;
}
ll a[nn][nn][10][2];
int main()
{
int n,m,k;
while(~scanf("%d%d%d",&n,&m,&k))
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
scanf("%lld",&a[i][j][0][0]);
a[i][j][0][1]=a[i][j][0][0];
}
for(int s=1;s<mm;s++)
{
for(int i=1;i+(1<<s)-1<=n;i++)
{
for(int j=1;j+(1<<s)-1<=m;j++)
{
int si=i+(1<<(s-1));
int sj=j+(1<<(s-1));
ll mina=min4(a[i][j][s-1][0],a[si][j][s-1][0],a[i][sj][s-1][0],a[si][sj][s-1][0]);
ll maxa=max4(a[i][j][s-1][1],a[si][j][s-1][1],a[i][sj][s-1][1],a[si][sj][s-1][1]);
a[i][j][s][0]=mina;
a[i][j][s][1]=maxa;
}
}
}
ll ans=0x7fffffff;
int l=0;
while(1<<(l+1)<=k) l++;
for(int i=1;i+k-1<=n;i++)
{
for(int j=1;j+k-1<=m;j++)
{
int si=i+k-(1<<l);
int sj=j+k-(1<<l);
ll mina=min4(a[i][j][l][0],a[si][j][l][0],a[i][sj][l][0],a[si][sj][l][0]);
ll maxa=max4(a[i][j][l][1],a[si][j][l][1],a[i][sj][l][1],a[si][sj][l][1]);
ans=min(ans,maxa-mina);
}
}
printf("%lld\n",ans);
}
return 0;
}
</span>