Cod sursa(job #1519127)
| Utilizator | Data | 6 noiembrie 2015 21:13:41 | |
|---|---|---|---|
| Problema | Teren | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.94 kb |
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,i,j,x,y,p,a[305][305],ii,jj,nr,maxim;
int main()
{
fin>>n>>m>>p;
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++)
{
for(ii=i;ii<=n;ii++)
{
for(jj=j;jj<=m;jj++)
{
nr=0;
for(x=i;x<=ii;x++)
{
for(y=j;y<=jj;y++)
{
nr+=a[x][y];
}
}
if((ii-i+1)*(jj-j+1)>maxim&&nr<=p)
{
maxim=(ii-i+1)*(jj-j+1);
}
}
}
}
}
fout<<maxim;
return 0;
}
