Pagini recente » Cod sursa (job #1120980) | Cod sursa (job #1223838) | Cod sursa (job #1254747) | Cod sursa (job #269530) | Cod sursa (job #2628331)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int mat[305][305];
int main()
{
int n, m, x, i, j, in, sf, s, maxx=0, a;
fin >> m >> n >> x;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
{
fin >> mat[j][i];
mat[j][i]+=mat[j][i-1];
}
for(i=1; i<=m; i++)
for(j=i; j<=m; j++)
{
in=1; sf=1; s=0;
while(sf<=n)
{
s+=mat[sf][j]-mat[sf][i-1];
while(s>x)
{
s-=mat[in][j]-mat[in][i-1];
in++;
}
if(s<=x) maxx=max(maxx, (sf-in+1)*(j-i+1));
sf++;
}
}
fout << maxx;
return 0;
}