Pagini recente » Cod sursa (job #1203425) | Cod sursa (job #3251253) | Cod sursa (job #2170228) | Cod sursa (job #582238) | Cod sursa (job #2561255)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int a[301][301],i,j,n,m,x,nr,st,i1,i2,maxi;
bool y;
int main()
{
fin>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
fin>>a[i][j];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
a[i][j]+=a[i-1][j];
for(i1=1;i1<=n;i1++)
for(i2=i1;i2<=n;i2++)
{
st=1;
nr=0;
for(j=1;j<=m;j++)
{
nr+=a[i2][j]-a[i1-1][j];
while(st<=j&&nr>x)
{
nr-=a[i2][st]-a[i1-1][st];
st++;
}
if(st<=j&&(i2-i1+1)*(j-st+1)>maxi)
maxi=(i2-i1+1)*(j-st+1);
}
}
fout<<maxi;
return 0;
}