Pagini recente » Cod sursa (job #2840061) | Cod sursa (job #2422676) | Cod sursa (job #2390042) | Cod sursa (job #2854947) | Cod sursa (job #2769155)
#include <fstream>
using namespace std;
ifstream fin ("teren.in");
ofstream fout ("teren.out");
int n,m,y,x,i,j,dr,maxc,a,st,sum,v[301][301];
int main()
{
fin>>n>>m>>y;
for (i=1; i<=n; i++)
{
for (j=1; j<=m; j++)
{
fin>>x;
v[i][j]=v[i-1][j]+x;
}
}
for (i=1; i<=n; i++)
{
for (j=i; j<=n; j++)
{
st=1;
sum=0;
for (dr=1; dr<=m; dr++)
{
sum=sum+v[j][dr]-v[i-1][dr];
while (st<=dr&&sum>y)
{
sum=sum-(v[j][st]-v[i-1][st]);
st++;
}
if (sum<=y)
{
a=(j-i+1)*(dr-st+1);
if (a>maxc)
maxc=a;
}
}
}
}
fout<<maxc;
return 0;
}