Pagini recente » Cod sursa (job #2647378) | Cod sursa (job #269343) | Cod sursa (job #1691066) | Monitorul de evaluare | Cod sursa (job #1516693)
#include<fstream>
using namespace std;
int n, m, a[301][301], i, j, x, ii, jj, maxim, nr, k, l;
int main()
{
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++) {
f>>a[i][j];
a[i][j] += (a[i-1][j] + a[i][j-1] - a[i-1][j-1]);
}
f.close();
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
for(ii=i;ii<=n;ii++)
for(jj=j;jj<=m;jj++)
{
nr=a[ii][jj] - a[ii][j-1] - a[i-1][jj] + a[i-1][j-1];
if(nr<=x)
if(maxim<(ii-i+1)*(jj-j+1))
maxim=(ii-i+1)*(jj-j+1);
}
g<<maxim;
g.close();
return 0;
}