Pagini recente » Cod sursa (job #735461) | Cod sursa (job #1070679) | Cod sursa (job #1168747) | Cod sursa (job #2050118) | Cod sursa (job #2556805)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,ii,jj,i,j,cnt,maxim,gasit=0;
bool v[305][305];
int verif(int x,int y,int z,int w,int nr1)
{
int i,j,cnt=0;
for(i=x;i<=z;i++)
{
for(j=y;j<=w;j++)
{
if(v[i][j]==1)
cnt++;
if(cnt>nr1)
return false;
}
}
return true;
}
int main()
{
f>>n>>m>>x;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
f>>v[i][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
gasit=0;
for(ii=i;ii<=n&&gasit==0;ii++)
{
for(jj=j;jj<=m&&gasit==0;jj++)
{
if(verif(i,j,ii,jj,x))
{
if((jj-j+1)*(ii-i+1)>maxim)
maxim=(jj-j+1)*(ii-i+1);
}
}
}
}
}
g<<maxim;
return 0;
}