Pagini recente » Cod sursa (job #1231225) | Cod sursa (job #105668) | Cod sursa (job #1398848) | Cod sursa (job #1269000) | Cod sursa (job #2703475)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m, a[16][16], c[16], ans = 0;
void backt(int k) {
if(k == m) {
int sum = 0;
for(int i = 0; i < n; i++) {
int now = 0;
for(int j = 0; j < m; j++) {
now += a[i][j] * c[j];
}
if(now < 0) now *= -1;
sum += now;
}
ans = max(ans, sum);
} else {
c[k] = 1;
backt(k + 1);
c[k] = -1;
backt(k + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
cin >> n >> m;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
cin >> a[i][j];
backt(0);
cout << ans << '\n';
}