Pagini recente » Cod sursa (job #2934952) | Cod sursa (job #949231) | Cod sursa (job #2876229) | Cod sursa (job #624314) | Cod sursa (job #3312205)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, k, i, j, a[17][17], rasp, sumCur;
int main() {
fin >> n >> m;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) fin >> a[i][j];
}
for(k = 1; k < (1 << m); k++) {
sumCur = 0;
for(int i = 1; i <= n; i++) {
int sum = 0;
for(int j = 0; j < m; j++) {
if(k >> j & 1) sum += a[i][j + 1];
else sum -= a[i][j + 1];
}
sumCur += (sum < 0 ? -sum : sum);
}
rasp = max(rasp, sumCur);
}
fout << rasp;
return 0;
}