Pagini recente » Cod sursa (job #1096733) | Cod sursa (job #407807) | Cod sursa (job #1156130) | Cod sursa (job #1206224) | Cod sursa (job #328738)
Cod sursa(job #328738)
#include<fstream>
#define maxn 303
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int a[maxn][maxn],s[maxn][maxn],run[maxn],i,j,n,m,k,p,x,y,smax;
int main()
{
f>>n>>m>>k;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
f>>a[i][j],s[i][j]=s[i-1][j]+a[i][j];
for(i=1;i<=n;++i)
for(j=i;j<=n;++j)
{
for(p=1;p<=m;++p)
run[p]=s[j][p]-s[i-1][p]+run[p-1];
x=1;
y=0;
while(x<=n)
{
while(run[y+1]-run[x-1]<=k&&y<m)
++y;
if((y-x+1)*(j-i+1)>smax)
smax=(y-x+1)*(j-i+1);
++x;
}
}
g<<smax<<"\n";
f.close();
g.close();
return 0;
}