最大子矩形问题模板

浅谈用极大化思想解决最大子矩阵问题

算法1：时间复杂度O(s^2)s为障碍物个数
题目：奶牛浴场

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define il inline
#define rg register
#define ll long long
#define N 6000
using namespace std;
int n,m,k,ans;
struct T{
    int i,j;
}node[N];
il int read()
{
    rg int data=0,w=1;rg char c=getchar();
    while((c<'0'||c>'9')&&c!='-')c=getchar();
    if(c=='-')w=-1,c=getchar();
    while(c>='0'&&c<='9')data=(data<<3)+(data<<1)+c-'0',c=getchar();
    return w*data;
}
int cmp(const T &x,const T &y){return x.j<y.j;}
int CMP(const T &x,const T &y){return x.i<y.i;}
int main()
{
    n=read(),m=read(),k=read();
    for(rg int i=1;i<=k;++i)
        node[i].i=read(),node[i].j=read();

    node[++k].i=0,node[k].j=0;
    node[++k].i=n,node[k].j=0;
    node[++k].i=0,node[k].j=m;
    node[++k].i=n,node[k].j=m;

    sort(node+1,node+k+1,cmp);

    for(rg int i=1;i<=k;++i){
        rg int up=0,down=n;
        for(rg int j=i+1;j<=k;++j){
            if(node[j].i<=down&&node[j].i>=up){
                ans=max(ans,(down-up)*(node[j].j-node[i].j));
                if(node[i].i==node[j].i)break;
                if(node[i].i>node[j].i)
                    up=node[j].i;
                else down=node[j].i;
            }
        }
        up=0,down=n;
        for(rg int j=i-1;j>=1;++j){
            if(node[j].i<=down&&node[j].i>=up){
                ans=max(ans,(down-up)*(node[i].j-node[j].j));
                if(node[i].i==node[j].i)break;
                if(node[i].i>node[j].i)
                    up=node[j].i;
                else down=node[j].i;
            }
        }
    }
    sort(node+1,node+k+1,CMP);
    for(rg int i=1;i<k;++i)
        ans=max(ans,(m*(node[i+1].i-node[i].i)));
    cout<<ans;
    return 0;
}

悬线法：时间复杂度O(n^2)

题目：最大全0子矩阵

#include<bits/stdc++.h>
using namespace std;
const int N = 2010;
int a[N][N];
int l[N], r[N], h[N];
int main()
{
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n ;j++)
            scanf("%d", &a[i][j]);
    int ans = 1;
    for(int i = 1; i <= n; i++)
        r[i] = n+1;
    for(int i = 1; i <= n; i++)
    {
        int ll = 0, rr = n+1;
        for(int j = 1; j <= n; j++)
        {
            if(a[i][j])
            {
                ll = j, l[j] = 0;
                h[j] = 0;
            }
            else
            {
                l[j] = max(l[j], ll);
                h[j]++;
            }
        }
        for(int j = n; j >= 1; j--)
        {
            if(a[i][j])
                rr = j, r[j] = n+1;
            else
            {
                r[j] = min(r[j], rr);
                ans = max(ans, (r[j]-l[j]-1)*h[j]);
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}