BZOJ1047(二维单调队列模板)

思路：我们先将每一行的相邻k列求出最大值和最小值，再按照行来进行单调对列。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000;
int a[maxn][maxn],mn[maxn][maxn],mx[maxn][maxn],mn2[maxn][maxn],mx2[maxn][maxn];
int Q[maxn];
int main(){
    int n,m,k;
    scanf("%d%d%d",&n,&m,&k);
    for( int i = 1;i <= n;i++ ){
        for( int j = 1;j <= m;j++){
            scanf("%d",&a[i][j]);
        }
    }
    int l,r;
    for( int i = 1;i <= n;i++ ){
        l =1; r = 0;
        for( int j = 1;j <= m;j++ ){
            while( l <= r && Q[l] <= j-k ) l++;
            while( l <= r && a[i][Q[r]] >= a[i][j]   ) r--;
            Q[++r] = j;
            mn[i][j] = a[i][Q[l]];
        }
        l = 1;r = 0;
        for( int j = 1;j <= m;j++ ){
            while( l <= r && Q[l] <= j-k ) l++;
            while( l <= r && a[i][Q[r]] <= a[i][j] ) r--;
            Q[++r] = j;
            mx[i][j] = a[i][Q[l]];
        }
    }
    for( int i = 1;i <= m;i++ ){
        l = 1;r = 0;
        for( int j = 1;j <= n;j++ ){
            while( l <= r && Q[l] <= j-k ) l++;
            while( l <= r && mn[ Q[r] ][ i ] >= mn[j][i] ) r--;
            Q[++r] = j;
            mn2[j][i] = mn[ Q[l] ][i];
        }
    }
    for( int i = 1;i <= m;i++ ){
        l = 1;r = 0;
        for( int j = 1;j <= n;j++ ){
            while( l <=r && Q[l] <= j-k ) l++;
            while( l <= r && mx[ Q[r] ][ i ] <= mx[j][i] ) r--;
            Q[++r] = j;
            mx2[j][i] = mx[Q[l]][i];
        }
    }
    int ans = 0x3f3f3f3f;
    for( int i = k;i <= n;i++ ){
        for( int j = k;j <= m;j++ ){
            ans = min( ans,mx2[i][j]-mn2[i][j] );
        }
    }
    printf("%d\n",ans);
    return 0;
}