Pagini recente » Cod sursa (job #214097) | Cod sursa (job #282336) | Cod sursa (job #1016514) | Cod sursa (job #2258538) | Cod sursa (job #1083261)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n, m, x, a, nru[301][301], i, j, k, t, s, st, dr, jo, su, l, amax=-2000000001;
int main()
{
f>>n>>m>>x;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{
f>>a;
if(a==1)
nru[i][j]=nru[i-1][j]+1;
else
nru[i][j]=nru[i-1][j];
}
}
for(i=1; i<=n; i++)
{
for(j=i; j<=n; j++)
{
l=0;
s=nru[j][1]-nru[i-1][1];
for(k=2; k<=m; k++)
{
t=nru[j][k]-nru[i-1][k];
if(s+t>x)
{
s=t;
l=0;
}
else
{
su=i;
jo=j;
st=k-2-l+1;
dr=k;
if (amax < (dr-st+1)*(jo-su+1))
amax=(dr-st+1)*(jo-su+1);
s+=t;
l++;
}
}
}
}
g<<amax;
return 0;
}