Pagini recente » Cod sursa (job #2961741) | Cod sursa (job #1028663) | Cod sursa (job #629239) | Cod sursa (job #772250) | Cod sursa (job #2854487)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,x,m,i,j,y,v[1001][1001],st,dr,i1,i2,sum[1001][1001],s,maxx;
int main()
{
fin>>n>>m>>x;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{
fin>>y;
sum[i][j]=sum[i-1][j]+y;
}
}
for(i1=1; i1<n; i++)
for(i2=i1; i2<=n; i2++)
{
st=1;s=0;///st=coloana din stanga
for(dr=1;dr<=m;dr++)
{
s+=sum[i2][dr]-sum[i1-1][dr];
while(st<=dr && s>x)
{
s=s-(sum[i2][st]-sum[i1-1][dr]);
st++;
}
if((i2-i1+1)*(dr-st+1)>maxx)
maxx=(i2-i1+1)*(dr-st+1);
}
}
fout<<maxx;
return 0;
}