Pagini recente » Cod sursa (job #204665) | Cod sursa (job #537998) | Cod sursa (job #1457260) | Cod sursa (job #2459341) | Cod sursa (job #2626550)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n, m, x;
int a[301][301];
int main()
{
f >> n >> m >> x;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
{
f >> a[i][j];
a[i][j] += a[i-1][j];
}
int ariaMax = 0;
for (int i=1; i<=n; i++)
for (int ii=i; ii<=n; ii++)
{
int sum = 0, st = 1;
for (int j=1; j<=m; j++)
{
sum += a[ii][j] - a[i-1][j];
while (sum > x)
{
sum -= a[ii][st] - a[i-1][st];
st++;
}
ariaMax = max(ariaMax, (j - st + 1) * (ii - i + 1));
}
}
g << ariaMax;
return 0;
}