Pagini recente » Cod sursa (job #542023) | Cod sursa (job #433722) | Cod sursa (job #191518) | Cod sursa (job #2197637) | Cod sursa (job #1915730)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,x,i,j,st,dr,nrp,Max,a[303][303];
int main()
{fin>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
for(j=1;j<=m;j++)
for(i=2;i<=n;i++)
a[i][j]+=a[i-1][j];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++){
st=1;
nrp=0;
for(dr=1;dr<=m;dr++){
nrp+=a[j][dr]-a[i-1][dr];
while(nrp>x){
nrp-=(a[j][st]-a[i-1][st]);
st++;}
Max=max(Max,(j-i+1)*(dr-st+1));} }
fout<<Max;
return 0;
}