Pagini recente » Cod sursa (job #432047) | Cod sursa (job #1980095) | Cod sursa (job #1397482) | Istoria paginii runda/ath3 | Cod sursa (job #496697)
Cod sursa(job #496697)
#include <fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
const int N=301;
int a[N][N],sum[N][N];
int main()
{
int n,m,i,j1,j2,i1,i2,j,s,A,Amax,x;
in>>n>>m>>x;
Amax=0;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
{
in>>a[i][j];
sum[i][j]=sum[i][j-1]+a[i][j];
}
for(j1=1;j1<=n;++j1)
for(j2=j1;j2<=m;++j2)
{
s=0;
i2=0;
for(i1=1;i1<=n;++i1)
{
while(i2<=n && s<=x)
{
++i2;
s=s+sum[i2][j2]-sum[i2][j1-1];
}
A=(j2-j1+1)*(i2-i1);
if(A>Amax)
Amax=A;
s=s-(sum[i1][j2]-sum[i1][j1-1]);
}
}
out<<Amax;
return 0;
}