【题解】洛谷P2216[HAOI2007]理想的正方形 二维RMQ

题目链接
打个二维ST表就结束了……不过这个ST表看得我眼花缭乱

#include<cstdio>
#include<algorithm>
#include<climits>
using namespace std;
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
#define _for(i,a,b) for(int i=(a);i<(b);i++)
const int N=1e3+10;
const int DEP=12;
const int INF=INT_MAX;
int a,b,n;
int num,st[N][N][DEP][2],log2[N];
inline int askmax(int i,int j)
{
    return max(st[i][j][log2[n-1]][1],max(st[i+n-(1<<(log2[n-1]))][j+n-(1<<(log2[n-1]))][log2[n-1]][1],max(st[i+n-(1<<(log2[n-1]))][j][log2[n-1]][1],st[i][j+n-(1<<(log2[n-1]))][log2[n-1]][1])));
}
inline int askmin(int i,int j)
{
    return min(st[i][j][log2[n-1]][0],min(st[i+n-(1<<(log2[n-1]))][j+n-(1<<(log2[n-1]))][log2[n-1]][0],min(st[i+n-(1<<(log2[n-1]))][j][log2[n-1]][0],st[i][j+n-(1<<(log2[n-1]))][log2[n-1]][0])));
}
int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d%d%d",&a,&b,&n);
    _rep(i,1,a)_rep(j,1,b)scanf("%d",&num),st[i][j][0][0]=st[i][j][0][1]=num;
    _for(i,0,N)log2[i]=i==0?-1:log2[i>>1]+1;
    _rep(k,1,log2[n])_rep(i,1,a-(1<<k)+1)_rep(j,1,b-(1<<k)+1)
    {
        st[i][j][k][0]=min(st[i][j][k-1][0],min(st[i+(1<<(k-1))][j+(1<<(k-1))][k-1][0],min(st[i+(1<<(k-1))][j][k-1][0],st[i][j+(1<<(k-1))][k-1][0])));
        st[i][j][k][1]=max(st[i][j][k-1][1],max(st[i+(1<<(k-1))][j+(1<<(k-1))][k-1][1],max(st[i+(1<<(k-1))][j][k-1][1],st[i][j+(1<<(k-1))][k-1][1])));
    }
    int minn=INF;
    _rep(i,1,a-n+1)_rep(j,1,b-n+1)minn=min(minn,askmax(i,j)-askmin(i,j));
    printf("%d\n",minn);
    return 0;
}