Pagini recente » Cod sursa (job #2021345) | Cod sursa (job #1101518) | Cod sursa (job #291544) | Cod sursa (job #442871) | Cod sursa (job #1591196)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,x,i,j,s[305][305],mx,t,k;
bool a[305][305];
int main()
{fin>>n>>m>>x;
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
{fin>>a[i][j];
}
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{if(a[i][j]==1)s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1]+1;
else s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1];
for(t=0;t<=i-1;t++)
{for(k=0;k<=j-1;k++)
{if((i-t)*(j-k)<=mx&&k==0){t=i;break;}
else if((i-t)*(j-k)<=mx) k=j;
else if((s[i][j]+s[t][k]-s[t][j]-s[i][k]<=x)&&(mx<(i-t)*(j-k)))mx=(i-t)*(j-k);
}
}
}
fout<<mx;
}