Pagini recente » Cod sursa (job #2667731) | Cod sursa (job #2970036) | Monitorul de evaluare | Cod sursa (job #1716615) | Cod sursa (job #3184696)
#include <fstream>
#define DIM 310
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int a[DIM][DIM];
int n, m, x, p, u, s, maxim, y, aria;
int main()
{
fin >> n >> m >> x;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
fin >> y;
a[i][j] = a[i-1][j] = y;
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
p = 1;
s = 0;
for(int u=1; u<=m; u++)
{
s+=(a[j][u] - a[j-1][u]);
while(s > x && p<=u)
{
s-=(a[j][p] - a[i-1][p]);
p++;
}
if(p<=u && s<=x && (j-i+1) * (u-p+1) >= aria)
aria = (j-i+1) * (u-p+1);
}
}
}
fout << aria;
return 0;
}