Pagini recente » Istoria paginii preoni-2007/runda-finala/solutii | Cod sursa (job #819964) | Cod sursa (job #1749929) | Monitorul de evaluare | Cod sursa (job #1517994)
#include <fstream>
using namespace std;
int n,m,a[301][301],i,j,ii,jj,x,y,p,maxim;
long long s,ok;
ifstream fin ("teren.in");
ofstream fout ("teren.out");
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++){
s = 0;
for (x=i;x<=ii;x++)
for (y=j;y<=jj;y++)
s+=a[x][y];
if ((ii-i+1)*(jj-j+1) > maxim && s<=p){
maxim = (ii-i+1)*(jj-j+1);
//ok = (ii-i+1)*(jj-j+1);
}
}
}
fout<<maxim;
return 0;
}