Pagini recente » Cod sursa (job #3156130) | Cod sursa (job #2999010) | Cod sursa (job #1104026) | Cod sursa (job #2934694) | Cod sursa (job #2841881)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("bmatrix.in");
ofstream out ("bmatrix.out");
int m,n,sol;
int s[205][205],s2[205][205];
int st[205],stg[205],drp[205],v[205],dp1[205],dp2[205];
char a[205][205],b[205][205];
void read()
{
in>>n>>m;
for(int i=1;i<=n;i++)
in>>(a[i]+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
b[j][i]=a[i][j];
}
int calc()
{
int maxx=0;
int top=0;
st[++top]=0;
v[0]=-1;
for(int i=1;i<=m;i++)
{
while(v[i]<=v[st[top]])
top--;
stg[i]=(i-st[top]-1);
st[++top]=i;
}
top=0;
st[++top]=m+1;
v[m+1]=-1;
for(int i=m;i>=1;i--)
{
while(v[i]<=v[st[top]])
top--;
drp[i]=(st[top]-i-1);
st[++top]=i;
}
for(int i=1;i<=m;i++)
{
maxx=max(maxx,v[i]*(stg[i]+drp[i]+1));
}
return maxx;
}
void solve(char a[205][205])
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i][j]=='0')
s[i][j]=s[i-1][j]+1;
else s[i][j]=0;
}
}
for(int i=n;i>=1;i--)
{
for(int j=1;j<=m;j++)
{
if(a[i][j]=='0')
s2[i][j]=s2[i+1][j]+1;
else s2[i][j]=0;
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
v[j]=s[i][j];
int x=calc();
dp1[i]=max(dp1[i-1],x);
}
for(int i=n;i>=1;i--)
{
for(int j=1;j<=m;j++)
v[j]=s2[i][j];
int x=calc();
dp2[i]=max(dp2[i+1],x);
}
for(int i=1;i<n;i++)
{
sol=max(sol, dp1[i]+dp2[i+1]);
}
}
int main()
{
read();
solve(a);
swap(m,n);
solve(b);
out<<sol;
return 0;
}