Pagini recente » Cod sursa (job #253408) | Cod sursa (job #2762247) | Cod sursa (job #1634087) | Cod sursa (job #340051) | Cod sursa (job #190636)
Cod sursa(job #190636)
#include <stdio.h>
int a[302][302],n,m,i,j,k,l,s,max,x;
int main()
{FILE *f;
f=fopen("teren.in","r");
fscanf(f,"%d %d %d",&n,&m,&x);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
fscanf(f,"%d",&a[i][j]);
fclose(f);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
a[i][j]=a[i][j]+a[i][j-1]+a[i-1][j]-a[i-1][j-1];
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
for (k=i;k<=n;k++)
for (l=j;l<=m;l++)
{s=a[k][l]-a[k][j-1]-a[i-1][l]+a[i-1][j-1];
if (s<=x) if (max<(k-i+1)*(l-j+1)) max=(k-i+1)*(l-j+1);
}
f=fopen("teren.out","w");
fprintf(f,"%d",max);
fclose(f);
return 0;
}