Pagini recente » Cod sursa (job #1852619) | Cod sursa (job #2677250) | Cod sursa (job #2286709) | Cod sursa (job #375508) | Cod sursa (job #2065773)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("sotron.in");
ofstream fout("sotron.out");
int a[302][302],n,i,j,maxim,x,m,s,y,st;
int main()
{
int i1=0;
int i2=0;
fin>>n>>m>>x;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
fin>>a[i][j];
a[i][j]+=a[i-1][j];
}
}
for(i1=1;i1<=n;i1++)
{
for(i2=i1;i2<=n;i2++)
{
s=0;
st=1;
for(j=1;j<=m;j++)
{
y=a[i2][j]-a[i1-1][j];
while(s+y>x&&st<j)
{
s=s-a[i2][st]+a[i1-1][st];
st++;
}
if(s+y<=x)
{
s+=y;
maxim=max(maxim,(i2-i1+1)*(j-st+1));
}
else
{
s=y;
st=j;
}
}
}
}
fout<<maxim;
return 0;
}