Pagini recente » Cod sursa (job #2857513) | Cod sursa (job #2524477) | Cod sursa (job #875718) | Cod sursa (job #1537804) | Cod sursa (job #593366)
Cod sursa(job #593366)
#include<stdio.h>
int n,m,x,a[301][301],s[301][301],l[301],i,j,k,count,pam,in=1;
int main()
{
freopen("teren.in","r",stdin);
freopen("teren.out","w",stdout);
scanf("%d%d%d",&n,&m,&x);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a[i][j]);
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
s[i][j]=s[i-1][j]+a[i][j];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
count=0;
in=1;
for(k=1;k<=m;k++)
l[k]=s[j][k]-s[i-1][k];
for(k=1;k<=m;k++)
{
count+=l[k];
while(in<=k&&count>x)
count-=l[in],in++;
if((j-i+1)*(k-in+1)>pam)
pam=(j-i+1)*(k-in+1) ;
}
}
printf("%d",pam);
return 0;
}