Pagini recente » Cod sursa (job #287046) | Cod sursa (job #2006984) | Cod sursa (job #2162425) | Cod sursa (job #1566171) | Cod sursa (job #389917)
Cod sursa(job #389917)
#include<fstream.h>
#define VMAX 300
int m,n,X,a[VMAX][VMAX],maxim;
void read()
{ ifstream f("teren.in");
f>>n>>m>>X;
int i,j,var;
for(i=0;i<n;++i)
for(j=0;j<m;++j)
{
f>>var;
if(i>0)a[i][j]+=a[i-1][j];
a[i][j]+=var;
}
f.close();
}
int suma(int x1,int y1,int x2,int y2)
{
int i,s=0;
for(i=y1;i<=y2;++i)
if(x1>0)s+=a[x2][i]-a[x1-1][i];
else s+=a[x2][i];
return s;
}
void search(int x,int y)
{
int i=x,j=y,var,s=0,jCreste=1;
var=(i-x+1)*(j-y+1);
while(i>=x)
{
s=suma(x,y,i,j);
if(s<=X&&j<m&&i<n)
{
if(var>maxim){maxim=var;++i;}
else if(jCreste<0)--i;
}
else{--i;j+=jCreste+1;}
if(i==n)
{--i;++j;}
if(j>=m)
{--j;jCreste=-1;}
var=(i-x+1)*(j-y+1);
if(var<=maxim)
i=-1;
}
}
int solve()
{
int i,j;
maxim=0;
for(i=0;i<n;++i)
for(j=0;j<m;++j)
if((n-i)*(m-j)>maxim)search(i,j);
return maxim;
}
int main()
{
read();
ofstream g("teren.out");
g<<solve();
g.close();
return 0;
}