牛客网 Wannafly挑战赛19 B-矩阵 DP

题目链接

题意：给出一个R行C列的矩阵M，求最大的行数不超过X，列数不超过Y，0的个数不超过Z的子矩阵和。

思路：类比最大子段和，预处理数组suml[i][j]表示M[1][j]+M[2][j]+M[3][j]+...+M[i][j]，num0[i][j]从第一行到第i行，j列上0的个数。枚举子矩阵的起始行i，终止行j(j-i+1<=X)，对于列的枚举即可类比最大子段和，计算过程中保持条件满足即可。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<queue>
using namespace std;
#define PI acos(-1)
#define INF 0x3f3f3f3f
#define NUM 101000
#define debug false
#define ll long long
#define lowbit(x) ((-(x))&(x))
#define ffor(i,d,u) for(int i=(d);i<=(u);++i)
#define _ffor(i,u,d) for(int i=(u);i>=(d);--i)
#define mst(array,Num) memset(array,Num,sizeof(array))
const int p = 1e9+7;
int r,c,x,y,z,num0[511][511]={};
ll suml[511][511]={},a[511][511];
struct ANS
{
    int znum;
    ll s;
};
template <typename T>
void read(T& x)
{
    x=0;
    char c;T t=1;
    while(((c=getchar())<'0'||c>'9')&&c!='-');
    if(c=='-'){t=-1;c=getchar();}
    do((x*=10)+=((int)(c-'0')));while((c=getchar())>='0'&&c<='9');
    x*=t;
}
template <typename T>
void write(T x)
{
    int len=0;char c[21];
    if(x<0)putchar('-');
    x=abs(x);
    do{++len;c[len]=(char)((x%10)+'0');}while(x/=10);
    _ffor(i,len,1)putchar(c[i]);
}
void AC()
{
    read(r);read(c);read(x);read(y);read(z);
    ffor(i,1,r)
        ffor(j,1,c)
        {
            read(a[i][j]);
            num0[i][j]=num0[i-1][j];
            if(a[i][j]==0)++num0[i][j];
            suml[i][j]=suml[i-1][j]+a[i][j];
        }
    int start;ANS sum;ll ans=0;
    ffor(i,1,r)
    {
        ffor(j,i,r)
        {
            if((j-i+1)>x)break;
            start=1;sum.s=sum.znum=0;
            ffor(k,1,c)
            {
                sum.s+=(suml[j][k]-suml[i-1][k]);
                sum.znum+=(num0[j][k]-num0[i-1][k]);
                if(sum.s<=0)
                {
                    sum.s=sum.znum=0;start=k+1;
                }
                else
                {
                    if(sum.znum<=z&&sum.s>ans)ans=sum.s;
                    if((k-start+1)>=y||sum.znum>z)//注意是>=y不是>y
                    {
                        sum.s-=(suml[j][start]-suml[i-1][start]);
                        sum.znum-=(num0[j][start]-num0[i-1][start]);
                        ++start;
                        while((sum.s<=0||suml[j][start]<=suml[i-1][start]||sum.znum>z)&&start<=k)
                        {
                            sum.s-=(suml[j][start]-suml[i-1][start]);
                            sum.znum-=(num0[j][start]-num0[i-1][start]);
                            ++start;
                        }
                    }
                }
                if(sum.s>ans)ans=sum.s;
            }
        }
    }
    write(ans);
}
int main()
{
    AC();
    return 0;
}