Pagini recente » Borderou de evaluare (job #2079423) | Cod sursa (job #3165916) | Cod sursa (job #2725000) | Cod sursa (job #88395) | Cod sursa (job #1516681)
#include <fstream>
using namespace std;
int m, n, i, j, maxim=-1, a[303][303],p,x,y,r,t,nr;
pair<int, int> v[90003];
int main()
{
ifstream fin("teren.in");
ofstream fout("teren.out");
fin>>m>>n>>p;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++){
fin>>a[i][j];
}
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
for(x=i+1;x<=m;x++)
for(y=j+1;y<=n;y++){
for(t=i;t<=x;t++)
for(r=j;r<=y;r++){
if(a[t][r]==1)
nr++;
}
if(nr<=p && maxim<(x-i+1)*(y-j+1))
maxim = (x-i+1)*(y-j+1);
nr=0;
}
fout<<maxim;
return 0;
}