Cod sursa(job #1516684)
| Utilizator | Data | 3 noiembrie 2015 13:35:18 | |
|---|---|---|---|
| Problema | Teren | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.86 kb |
#include<fstream>
using namespace std;
int n, m, a[301][301], i, j, x, ii, jj, maxim, nr, k, l;
int main()
{
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
f.close();
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(k=i;k<=ii;k++)
for(l=j;l<=jj;l++)
{
if(a[k][l]==1)
nr++;
}
if(nr==x)
if(maxim<(ii-i+1)*(jj-j+1))
maxim=(ii-i+1)*(jj-j+1);
}
g<<maxim;
g.close();
return 0;
}
