Pagini recente » Cod sursa (job #2988429) | Cod sursa (job #2667600) | Cod sursa (job #240734) | Cod sursa (job #3251466) | Cod sursa (job #499478)
Cod sursa(job #499478)
#include<cstdio>
const int N=303;
int n,m,max;
short int l[N][N],x;
void citire()
{
freopen("teren.in","r",stdin);
freopen("teren.out","w",stdout);
scanf("%d%d%d",&n,&m,&max);
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j)
{
scanf("%hd",&x);
l[i][j]=l[i][j-1]+x;
}
}
void afis()
{
int ariemax=-1,j,s,i;
for (int i1=1;i1<=m;++i1)
for (int i2=i1;i2<=m;++i2)
{
j=0,s=0;
for (i=1;i<=m;++i)
{
while (j<=n && s<=max)
{
++j;
s+=l[j][i2]-l[j][i1-1];
}
if ((j-i)*(i2-i1+1)>ariemax)
ariemax=(j-i)*(i2-i1+1);
s-=l[i][i2]-l[i][i1-1];
}
}
printf("%d\n",ariemax);
}
int main()
{
citire();
afis();
return 0;
}