Pagini recente » Cod sursa (job #36743) | Cod sursa (job #51746) | Cod sursa (job #110153) | Cod sursa (job #1004882) | Cod sursa (job #2194547)
#include <fstream>
using namespace std;
ifstream fin("filip.in");
ofstream fout("filip.out");
int N, M;
int A[20][20];
int X[20];
int MSum;
void Read()
{
fin >> N >> M;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
fin >> A[i][j];
}
void Solve()
{
int Sum = 0;
for (int j = 1; j <= M; j++)
{
int s = 0;
for (int i = 1; i <= N; i++)
s += A[i][j] * X[i];
if (s < 0)
s *= -1;
Sum += s;
}
if (Sum > MSum) {
MSum = Sum;
}
}
void Back(int l)
{
for (int i = -1; i <= 1; i += 2)
{
X[l] = i;
if (l == N)
Solve();
else
Back(l + 1);
}
}
int main()
{
Read();
Back(1);
fout << MSum;
return 0;
}