Pagini recente » Cod sursa (job #1617021) | Cod sursa (job #1589741) | Cod sursa (job #2556151)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("teren.in");
ofstream fout ("teren.out");
int n,m,x,V[301][301],D[301][301],S,st,A;
int main ()
{
fin>>n;
fin>>m;
fin>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
fin>>V[i][j];
D[i][j]=D[i-1][j]+V[i][j];
}
for(int i=1;i<=n;i++)
{
for(int l=i;l<=n;l++)
{
S=0;
st=1;
for(int j=1;j<=m;j++)
{
S=S+D[l][j]-D[l-i][j];
while(S>x)
{
S=S-(D[l][st]-D[l-i][st]);
st++;
}
if(i*(j-st+1)>A)
A=i*(j-st+1);
}
}
}
fout<<A;
return 0;
}