Cod sursa(job #1572000)
| Utilizator | Data | 18 ianuarie 2016 18:18:56 | |
|---|---|---|---|
| Problema | Teren | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int a[305][305],i,j,n,m,max1,fin,x,y;
int main()
{
f>>n>>m>>max1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>a[i][j];
a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
}
for(i=1;i<n;i++)
for(j=1;j<m;j++)
for(x=i+1;x<=n;x++)
for(y=j+1;y<=m;y++)
if(a[x][y]-a[x][j-1]-(a[i-1][y]-a[i-1][j-1])<=max1)
fin=max(fin,(x-i+1)*(y-j+1));
g<<fin;
return 0;
}
