Pagini recente » Cod sursa (job #1658391) | Cod sursa (job #2066436) | Cod sursa (job #2700059) | Cod sursa (job #2545024) | Cod sursa (job #3305123)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
const int NMMAX = 16;
int a[NMMAX][NMMAX];
int main()
{
int n, m;
fin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
fin >> a[i][j];
}
}
int smax = 0;
for (int mask = 0; mask < (1 << m); mask++) {
int sum = 0;
for (int i = 0; i < n; i++) {
int slin = 0;
for (int j = 0; j < m; j++) {
if (mask & (1 << j)) slin -= a[i][j];
else slin += a[i][j];
}
sum += abs(slin);
}
smax = max(smax, sum);
}
fout << smax;
return 0;
}