Pagini recente » Cod sursa (job #390260) | Cod sursa (job #1305498) | Cod sursa (job #2899528) | Cod sursa (job #1873002) | Cod sursa (job #2160525)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int a[301][301];
int n,m,p,i,j,x,st,dr,Max,s;
int main()
{
fin>>n>>m>>p;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
fin>>x;
a[i][j]=a[i-1][j]+x;
}
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
st=1;
s=0;
for(dr=st;dr<=m;dr++)
{
s=s+a[j][dr]-a[i-1][dr];
while(st<=dr&&s>p)
{
s=s-(a[j][st]-a[i-1][st]);
st++;
}
if(st<=dr)
{
if((j-i+1)*(dr-st+1)>Max)
Max=(j-i+1)*(dr-st+1);
}
}
}
}
fout<<Max;
return 0;
}