1047: [HAOI2007]理想的正方形

https://www.lydsy.com/JudgeOnline/problem.php?id=1047

思路：二维单调队列求子矩阵最大值最小值的最小差值； 

ans的判断方错位置，坑自己

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

deque<int>q1,q2;
int mp[maxn][maxn];
int Min[maxn][maxn],Max[maxn][maxn];
//int tmp1[maxn][maxn],tmp2[maxn][maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,a,b;
    cin>>a>>b>>n;
    for(int i=1;i<=a;i++)
    {
        for(int j=1;j<=b;j++)
        {
            cin>>mp[i][j];
        }
    }
    for(int i=1;i<=a;i++)
    {
        q1.clear();
        q2.clear();
        for(int j=1;j<=b;j++)
        {
            while(!q1.empty()&&mp[i][q1.back()]>=mp[i][j]) q1.pop_back();
            q1.push_back(j);
            if(j>=n)
            {
                while(!q1.empty()&&q1.front()<=j-n) q1.pop_front();
                Min[i][j-n+1]=mp[i][q1.front()];
            }

            while(!q2.empty()&&mp[i][q2.back()]<=mp[i][j]) q2.pop_back();
            q2.push_back(j);
            if(j>=n)
            {
                while(!q2.empty()&&q2.front()<=j-n) q2.pop_front();
                Max[i][j-n+1]=mp[i][q2.front()];
            }
        }
    }

    /*for(int i=1;i<=a;i++)
    {
        for(int j=1;j<=b-n+1;j++)
        {
            //cout<<Max[i][j]<<" ";
            cout<<Min[i][j]<<" ";
        }
        cout<<endl;
    }*/

    int minn=0;
    int maxx=0;
    int ans=INF;
    for(int j=1;j<=b-n+1;j++)
    {
        q1.clear();
        q2.clear();
        for(int i=1;i<=a;i++)
        {
            //cout<<Max[i][j]<<" ";
            while(!q1.empty()&&Min[q1.back()][j]>=Min[i][j]) q1.pop_back();
            q1.push_back(i);
            if(i>=n)
            {
                while(!q1.empty()&&q1.front()<=i-n) q1.pop_front();
                minn=Min[q1.front()][j];
                //tmp1[i-n+1][j]=minn;
            }

            while(!q2.empty()&&Max[q2.back()][j]<=Max[i][j]) q2.pop_back();
            q2.push_back(i);
            if(i>=n)
            {
                while(!q2.empty()&&q2.front()<=i-n) q2.pop_front();
                maxx=Max[q2.front()][j];
                //tmp2[i-n+1][j]=maxx;
            }
            if(i>=n) ans=min(ans,maxx-minn);
        }
        //cout<<maxx<<" "<<minn<<endl;
    }

    /*for(int i=1;i<=a-n+1;i++)
    {
        for(int j=1;j<=b-n+1;j++)
        {
            //cout<<tmp2[i][j]<<" ";
            cout<<tmp1[i][j]<<" ";
        }
        cout<<endl;
    }*/

    cout<<ans<<endl;
    return 0;
}