Pagini recente » Cod sursa (job #628892) | Cod sursa (job #2790838) | Cod sursa (job #908985) | Cod sursa (job #3248317) | Cod sursa (job #2854438)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,x,v[305][305],s[305][305],ap,maxim;
int main()
{
fin>>n>>m>>x;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
fin>>v[i][j];
s[i][j]=s[i-1][j]+v[i][j];
}
}
for(int l1=1;l1<=n;l1++)
{
for(int l2=l1;l2<=n;l2++)
{
int suma=0;
int st=1;
for(int dr=1;dr<=m;dr++)
{
suma+=s[l2][dr]-s[l1-1][dr];
while(suma>x && st<=dr)
{
suma=suma-(s[l2][st]-s[l1-1][st]);
st++;
}
maxim=max(maxim,(l2-l1+1)*(dr-st+1));
}
}
}
fout<<maxim;
}