Pagini recente » Cod sursa (job #2830266) | Cod sursa (job #1565646) | Cod sursa (job #1508032) | Cod sursa (job #2610740) | Cod sursa (job #2854444)
#include <fstream>
using namespace std;
ifstream fin ("teren.in");
ofstream fout("teren.out");
int n,m,X,a[301][301],S[301][301],s,st,sol,i,j,l;
int main ()
{
fin>>n>>m>>X;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
fin>>a[i][j];
S[i][j]=S[i-1][j]+a[i][j];
}
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
s=0;
st=1;
for(l=1;l<=m;l++)
{
s=s+S[j][l]-S[j-i][l];
while(s>X)
{
s=s-(S[j][st]-S[j-i][st]);
st++;
}
if(i*(l-st+1)>sol)
sol=i*(l-st+1);
}
}
}
fout<<sol;
return 0;
}