Cod sursa(job #2184829)

Utilizator darisavuSavu Daria darisavu Data 24 martie 2018 11:24:19
Problema BMatrix Scor 48
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.41 kb
#include <fstream>

using namespace std;
ifstream f("bmatrix.in");
ofstream g("bmatrix.out");
int a[205][205],st[205],i,j,n,m,dr[205],sus[205],jos[205],b[205][205],d[205][205],p,l,sol,y;
char c;
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
    {
        f>>c;
        a[i][j]=c-'0';
        if(a[i][j]==1)
        {
            b[i][j]=0;
        }
        else
        {
            b[i][j]=b[i-1][j]+1;
        }
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
    {
        p=b[i][j];
        y=0;
        for(l=j-1;l>=1;l--)
        {
            p=min(p,b[i][l]);
            y=max(y,p*(j-l+1));
        }
        st[i]=max(st[i],max(st[i-1],y));
        jos[j]=max(jos[j],max(jos[j-1],y));

    }
    for(i=n;i>=1;i--)
        for(j=m;j>=1;j--)
    {
        if(a[i][j]==1)
        {
            d[i][j]=0;
        }
        else
        {
            d[i][j]=d[i+1][j]+1;
        }
    }
    for(i=n;i>=1;i--)
        for(j=m;j>=1;j--)
    {
        p=d[i][j];
        for(l=j+1;l<=m;l++)
        {
            p=min(p,d[i][l]);
            y=max(y,p*(l-j+1));
        }
       dr[i]=max(dr[i],max(dr[i+1],y));
        jos[j]=max(jos[j],max(jos[j+1],y));

    }
    for(i=1;i<n;i++)
    {
        sol=max(sol,sus[i]+jos[i+1]);
    }
    for(i=1;i<m;i++)
    {
        sol=max(sol,st[i]+dr[i+1]);
    }
    g<<sol;
    return 0;
}