Pagini recente » Cod sursa (job #1286631) | Cod sursa (job #2177531) | Cod sursa (job #688487) | Cod sursa (job #2056005) | Cod sursa (job #884890)
Cod sursa(job #884890)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int i,j,x,n,m,sus,jos,a[301][301],b[301],st,dr,s;
int main()
{
f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
f>>a[i][j];
a[i][j]+=a[i-1][j];
}
int max=0;
for(sus=1;sus<=n;sus++)
for(jos=sus;jos<=n;jos++){
st=1;s=0;
for(dr=1;dr<=m;dr++){
b[dr]=a[jos][dr]-a[sus-1][dr];
s+=b[dr];
while(x<s&&st<dr){
s-=b[st];
st++;
}
if((jos-sus+1)*(dr-st+1)>max&&s<=x)
max=(jos-sus+1)*(dr-st+1);
}
}
g<<max;
return 0;
}