Pagini recente » Cod sursa (job #433370) | Cod sursa (job #3136059) | Cod sursa (job #2972363) | Cod sursa (job #765208) | Cod sursa (job #2087765)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,maxi,s,st,a[305][305],dr,i,j;
int main()
{
f>>n>>m>>x;
for(i=1;i<=n;i++)
a[i][m+1]=i*(x+1);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>a[i][j];
a[i][j]+=a[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+=a[j][dr]-a[i-1][dr];
while(s>x&&st<=dr)
{
s-=(a[j][st]-a[i-1][st]);
st++;
}
maxi=max(maxi,(j-i+1)*(dr-st+1));
}
}
g<<maxi;
}