Pagini recente » Cod sursa (job #2254794) | Cod sursa (job #1119426) | Cod sursa (job #953736) | Cod sursa (job #2903486) | Cod sursa (job #2628334)
#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 >> n >> m >> x;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
fin >> mat[i][j];
mat[i][j]+=mat[i-1][j];
}
for(i=1; i<=n; i++)
for(j=i; j<=n; j++)
{
in=1; s=0;
for(sf=1; sf<=m; sf++)
{
s+=mat[j][sf]-mat[i-1][sf];
while(s>x)
{
s-=mat[j][in]-mat[i-1][in];
in++;
}
maxx=max(maxx, (sf-in+1)*(j-i+1));
}
}
fout << maxx;
return 0;
}