Pagini recente » Cod sursa (job #1196319) | Cod sursa (job #105232) | Cod sursa (job #26725) | Cod sursa (job #1582398) | Cod sursa (job #2361020)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,v[305][305],a,k;
int main()
{
f>>n>>m>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>k,v[i][j]=v[i-1][j]+k;
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
{
int p=1,nr=0;
for(int u=1;u<=m;u++)
{
nr+=v[j][u]-v[i-1][u];
while(nr>x&&p<=u)
nr-=v[j][p]+v[i-1][p],p++;
if(nr<=x&&p<=u)
a=max(a,(j-i+1)*(u-p+1));
}
}
g<<a<<'\n';
return 0;
}