Pagini recente » Cod sursa (job #2922653) | Cod sursa (job #1855223) | Cod sursa (job #3251289) | Cod sursa (job #944019) | Cod sursa (job #1356057)
#include <fstream>
using namespace std;
ifstream fin ("zidar.in");
ofstream fout ("zidar.out");
int N, M, Cmax, E, sol, A[51][21], V[51][21][21][61];
int main()
{
fin >> N >> M >> Cmax >> E;
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= M; j++)
{
fin>> A[i][j];
}
}
for (int i = 1; i <= N; i++)
{
for (int nrc = 1; nrc <= Cmax && nrc <= (i + 1) * M; nrc++)
{
for (int a = 1; a <= M; a++)
{
int sum = 0, num, cord;
for (int b = a; b <= M; b++)
{
sum += A[i][b];
num = b - a + 1;
for (int j = a; j <= b; j++)
{
cord = j + nrc - 1;
if (cord <= M && sum + V[i-1][j][cord][nrc] <= E)
{
V[i][j][cord][nrc + num] = sum + V[i-1][j][cord][nrc];
if (nrc + num > sol) sol = nrc + num;
}
cord = j - nrc + 1;
if (cord >= 1 && sum + V[i-1][cord][j][nrc] <= E)
{
V[i][cord][j][nrc + num] = sum + V[i-1][cord][j][nrc];
if (nrc + num > sol) sol = nrc + num;
}
}
}
}
}
}
fout << sol << '\n';
fout.close();
return 0;
}