Pagini recente » Cod sursa (job #1625353) | Cod sursa (job #2110221) | Cod sursa (job #3149368) | Cod sursa (job #1340339) | Cod sursa (job #2324991)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,k,i,j,ii,jj,dm,dim,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 (ii=i;ii<=n;ii++)
{
j=1;
for (jj=1;jj<=m;jj++)
{
while (a[ii][jj]-a[ii][j-1]-a[i-1][jj]+a[i-1][j-1]>k && j<=jj) j++;
dim=(ii-i+1)*(jj-j+1);
if (dim>dm) dm=dim;
}
}
}
fout << dm;
return 0;
}