Pagini recente » Cod sursa (job #83265) | Cod sursa (job #3130271) | Cod sursa (job #759541) | Cod sursa (job #285839) | Cod sursa (job #2000893)
#include <iostream>
#include <fstream>
#define INF 1000000000
long long v[16][16];
long long sum[16];
int n, m;
using namespace std;
int main() {
ifstream fi("flip.in");
ofstream fo("flip.out");
int i, j, k;
fi >> n >> m;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
fi >> v[i][j];
}
}
long long lim = 1 << n;
long long mx = -INF;
long long s;
for (k = 0; k < lim; k++) {
s = 0;
for (j = 0; j < m; j++) {
sum[j] = 0;
for (i = 0; i < n; i++) {
if (k & (1 << i))
sum[j] -= v[i][j];
else
sum[j] += v[i][j];
}
if (sum[j] > 0)
s += sum[j];
else
s -= sum[j];
}
if (s > mx)
mx = s;
}
fo << mx;
fi.close();
fo.close();
return 0;
}