Pagini recente » Cod sursa (job #3254176) | Cod sursa (job #12543) | Cod sursa (job #943760) | Cod sursa (job #3328500) | Cod sursa (job #3304882)
#include <iostream>
using namespace std;
int a[18][18];
int main() {
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
cin.tie(nullptr) -> sync_with_stdio(false);
int n, m; cin >> n >> m;
for(int i = 0; i < n; i ++) {
for(int j = 0; j < m; j ++) {
cin >> a[i][j];
}
}
int ans = 0;
for(int mask = 0; mask < (1 << m); mask ++) {
int sum = 0;
for(int i = 0; i < n; i ++) {
int ssum = 0;
for(int j = 0; j < m; j ++) {
if(mask & (1 << j))
ssum += a[i][j] * -1;
else
ssum += a[i][j];
}
sum += abs(ssum);
}
ans = max(ans, sum);
}
cout << ans;
}