Pagini recente » Cod sursa (job #538475) | Cod sursa (job #426099) | Cod sursa (job #2082178) | Cod sursa (job #1311102) | Cod sursa (job #2070640)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,i,j,s[301][302],S,st,dr,Max;
int main()
{
f>>n>>m>>x;
for(i=1;i<=n;i++)
s[i][m+1]=i*(x+1);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>s[i][j];
s[i][j]+=s[i-1][j];
}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
st=1;
S=0;
for(dr=1;dr<=m;dr++)
{
S+=s[j][dr]-s[i-1][dr];
while(S>x&&st<=dr)
{
S-=(s[j][st]-s[i-1][st]);
st++;
}
Max=max(Max,(j-i+1)*(dr-st+1));
}
}
g<<Max;
return 0;
}