Pagini recente » Cod sursa (job #1240419) | Cod sursa (job #2886084) | Cod sursa (job #2065080) | Cod sursa (job #384631) | Cod sursa (job #2854429)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int m,n,x,a[301][301],sum[301][301],amax;
int main()
{
fin>>n>>m>>x;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
fin>>a[i][j];
sum[i][j]=a[i][j]+sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
}
}
for(int l1=1;l1<=n;l1++)
{
for(int l2=l1;l2<=n;l2++)
{
int st=1;
for(int dr=1;dr<=m;dr++)
{
int s=sum[l2][dr]-sum[l1-1][dr]-sum[l2][st-1]+sum[l1-1][st-1];
while(s>x && st<=dr)
{
st++;
s=sum[l2][dr]-sum[l1-1][dr]-sum[l2][st-1]+sum[l1-1][st-1];
}
if(s<=x)
{
int l=(l2-l1+1)*(dr-st+1);
if(l>amax)
{
amax=l;
}
}
}
}
}
fout<<amax;
return 0;
}