Pagini recente » Cod sursa (job #1221172) | Cod sursa (job #2122157) | Cod sursa (job #2030157) | Cod sursa (job #1141199) | Cod sursa (job #2324241)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,k,i,j,ii,jj,dm,dim,s,x,a[305][305];
int main()
{
fin >> n >> m >> k;
for (i=1;i<=n;i++) for(j=1;j<=m;j++)
{
fin >> x;
a[i][j]=a[i][j-1]+a[i-1][j]-a[i-1][j-1]+x;
}
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
{
for (ii=1;ii<=n;ii++)
{
for (jj=1;jj<=m;jj++)
{
s=a[ii][jj]-a[ii][j-1]-a[i-1][jj]+a[i-1][j-1];
dim=(ii-i+1)*(jj-j+1);
if(s<=k && dim>dm)
{
dm=dim;
}
}
}
}
}
fout << dm;
return 0;
}