Pagini recente » Cod sursa (job #850602) | Cod sursa (job #3031727) | Cod sursa (job #861966) | Cod sursa (job #2626750) | Cod sursa (job #414307)
Cod sursa(job #414307)
# include <fstream>
using namespace std;
int n, m, x, s[303][303], sol;
void read ()
{
ifstream fin ("teren.in");
fin>>n>>m>>x;
int q;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
fin>>q;
s[i][j]=s[i-1][j]+q;
}
}
void solve ()
{
int dq[303], st, dr, i, j, k, scur, dqp[303];
for (i=0;i<n;i++)
for (j=1;j<=n;j++)
{
st=dr=1;
dq[st]=0;
dqp[st]=0;
for (k=1;k<=m;k++)
{
dq[++dr]=dq[dr-1]+s[j][k]-s[i][k];
dqp[dr]=k;
while (dq[dr]-dq[st]>x && st<dr)++st;
if ((k-dqp[st])*(j-i)>sol)
sol=(k-dqp[st])*(j-i);
}
}
}
int main ()
{
read ();
solve ();
ofstream fout ("teren.out");
fout<<sol;
return 0;
}