Pagini recente » Cod sursa (job #2758263) | Cod sursa (job #135310) | Cod sursa (job #238988) | Cod sursa (job #44639) | Cod sursa (job #1125686)
#include<fstream>
using namespace std;
int a[100][100],va[10000];
int main()
{
ifstream fin("teren.in");
ofstream fout("teren.out");
int m,bad,n,i,j,x,z,y,t,d,aria,ariamax;
fin>>n>>m>>x;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
fin>>a[i][j];
fin.close();
ariamax=-1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
for(t=i;t<=n;t++)
for(d=j;d<=m;d++)
{
bad=0;
for(z=i;z<=t;z++)
for(y=j;y<=d;y++)
bad+=a[z][y];
if(bad<=x)
{
aria=(t-i+1)*(d-j+1);
if(aria>ariamax)ariamax=aria;
}
}
fout<<ariamax;
fout.close();
return 0;
}