Pagini recente » Cod sursa (job #2294469) | Cod sursa (job #1307815) | Cod sursa (job #171847) | Cod sursa (job #571924) | Cod sursa (job #2390400)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
const int VAL=305;
int N, M, X, i, j;
int v[VAL][VAL], col[VAL][VAL];
int lin, L, be, S, ANS;
int main()
{
fin >> N >> M >> X;
for (i=1; i<=N; i++)
{
for (j=1; j<=M; j++)
{
fin >> v[i][j];
col[i][j]=col[i-1][j]+v[i][j];
}
}
for (lin=1; lin<=N; lin++)
{
for (L=lin; L<=N; L++)
{
be=1;
S=0;
for (j=1; j<=M; j++)
{
S+=col[L][j]-col[L-lin][j];
while (S>X)
{
S-=col[L][be]-col[L-lin][be];
be++;
}
ANS=max(ANS, lin*(j-be+1));
}
}
}
fout << ANS << '\n';
fin.close();
fout.close();
return 0;
}