Pagini recente » Cod sursa (job #2209392) | Cod sursa (job #1485362) | Cod sursa (job #499154) | Cod sursa (job #3218038) | Cod sursa (job #499678)
Cod sursa(job #499678)
#include<fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
int n,m,M,q[303][303],x;
int main()
{
in>>n>>m>>M;
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j)
{
in>>x;
q[i][j]=q[i][j-1]+x;
}
int arieM=-1,j,s,i;
for (int i1=1;i1<=m;++i1)
for (int i2=i1;i2<=m;++i2)
{
j=0,s=0;
for (i=1;i<=m;++i)
{
while (j<=n && s<=M)
{
++j;
s+=q[j][i2]-q[j][i1-1];
}
if ((j-i)*(i2-i1+1)>arieM)
arieM=(j-i)*(i2-i1+1);
s-=q[i][i2]-q[i][i1-1];
}
}
out<<arieM<<'\n';
return 0;
}