Pagini recente » Cod sursa (job #2655971) | Cod sursa (job #324327) | Borderou de evaluare (job #2830519) | Cod sursa (job #2825865) | Cod sursa (job #1848858)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int v[302][302];
int n,m,ma,x,p;
int main()
{
f>>n>>m>>x;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
f>>v[i][j];
v[i][j]=v[i][j]+v[i-1][j]+v[i][j-1]-v[i-1][j-1];
}
}
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
p=0;
for(int k=1;k<=m;k++)
{
while(v[j][k]-v[i-1][k]-v[j][p]+v[i-1][p]>x)
{
p++;
}
ma=max(ma,(k-p)*(j-i+1));
}
}
}
g<<ma;
f.close();
g.close();
return 0;
}