Pagini recente » Cod sursa (job #1349573) | Cod sursa (job #2892295) | Cod sursa (job #80355) | Cod sursa (job #955280) | Cod sursa (job #2360993)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,v[305][305],a;
int main()
{
f>>n>>m>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>v[i][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
v[i][j]=v[i][j-1]+v[i-1][j]-v[i-1][j-1]+v[i][j];
for(int i1=1;i1<=n;i1++)
for(int j1=1;j1<=m;j1++)
{
for(int i=i1;i<=n;i++)
for(int j=j1+1;j<=m;j++)
{
int x1=v[i][j]-v[i][j1-1]-v[i1-1][j]+v[i1-1][j1-1];
if(x1<=x) a=max((i-i1+1)*(j-j1+1),a);
}
}
g<<a<<'\n';
return 0;
}