Pagini recente » Borderou de evaluare (job #3170821) | Cod sursa (job #2497650) | Borderou de evaluare (job #3163761) | Cod sursa (job #715228) | Cod sursa (job #3301677)
#include <cstdio>
int main() {
freopen ("flip.in", "r", stdin), freopen ("flip.out", "w", stdout);
int n, m, a[16][16];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
int best = -(int) 1e9;
for (int mask = 0; mask < (1 << m); mask++) {
int cur = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
if (mask & (1 << j)) {
sum += a[i][j];
} else {
sum -= a[i][j];
}
}
cur += (sum > 0) ? sum : -sum;
}
best = (cur > best) ? cur : best;
}
printf("%d\n", best);
}