Pagini recente » Cod sursa (job #2394981) | Borderou de evaluare (job #2243379) | Cod sursa (job #2118393) | Cod sursa (job #2110000) | Cod sursa (job #323522)
Cod sursa(job #323522)
#include<stdio.h>
long n,m,k,i,j,t,s[305][305],st,dr,suma,am;
int main()
{
freopen("teren.in","r",stdin);
freopen("teren.out","w",stdout);
scanf("%ld%ld%ld",&n,&m,&k);
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
{scanf("%ld",&t);
s[j][i]=s[j][i-1]+t;}
for(i=1;i<=n;++i)
for(j=i;j<=n;++j)
{st=1;
suma=0;
for(dr=1;dr<=m;++dr)
{suma+=(s[dr][j]-s[dr][i-1]);
while(st<=dr&&suma>k)
{suma-=(s[st][j]-s[st][i-1]);
st++;}
if(st<=dr)if(am<(j-i+1)*(dr-st+1))am=(j-i+1)*(dr-st+1);}}
printf("%ld",am);
return 0;
}