Pagini recente » Cod sursa (job #448743) | Cod sursa (job #1907239) | Cod sursa (job #141864) | Cod sursa (job #153014) | Cod sursa (job #206743)
Cod sursa(job #206743)
#include <fstream.h>
int i,j,n,m,k,x,dr,st,sum,a_max;
short int a[300],s[172][172];
int main()
{
ifstream fin("teren.in");
ofstream fout("teren.out");
fin>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{fin>>s[i][j];
s[i][j]+=s[i-1][j];
}
fin.close();
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{for(k=1;k<=m;k++)
a[k]=s[j][k]-s[i-1][k];
st=1;
sum=0;
for(dr=1;dr<=m;dr++)
{sum+=a[dr];
while(st<=dr && sum>x)
{sum-=a[st];
st++;
}
if(st<=dr)
if(a_max<(j-i+1)*(dr-st+1))
a_max=(j-i+1)*(dr-st+1);
}
}
fout<<a_max;
fout.close();
return 0;
}