Pagini recente » Cod sursa (job #679933) | Cod sursa (job #1214881) | Cod sursa (job #2613426) | Cod sursa (job #3041668) | Cod sursa (job #2770814)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int a[310][310],b[310],m,n,i,j,x,smax,p,u,y,k,s;
int main()
{
fin >>n>>m>>x;
smax=-1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
fin>>y;
a[i][j]=a[i-1][j]+y;
}
}
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
for(k=1;k<=m;k++)
{
b[k]=a[j][k]-a[i-1][k];
}
p=1;
u=1;
s=0;
while(u<=m)
{
while(b[u]+s<=x&&u<=m)
{
s=s+b[u];
u++;
}
s=s-b[p];
if (smax<(j-i+1)*(u-p))
smax=(j-i+1)*(u-p);
p++;
}
}
}
fout <<smax;
return 0;
}