Pagini recente » Cod sursa (job #1210939) | Cod sursa (job #2113198) | Cod sursa (job #1148731) | Cod sursa (job #20580) | Cod sursa (job #1595147)
#include <cstdio>
#include <iostream>
#include <set>
#include <climits>
#include <map>
#include <algorithm>
#include <list>
#include <vector>
#include <utility>
#include <cstdlib>
#include <iomanip>
#include <cstring>
#include <string>
using namespace std;
int main() {
// freopen("tt.txt", "r", stdin);
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, a[16][16];
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int e[16];
e[0] = 1;
for (int i = 1; i <= n; i++) {
e[i] = e[i - 1] << 1;
}
int ans = LONG_MIN;
for (int k = 0; k < e[n]; k++) {
int sum[16];
for (int j = 0; j < m; j++)
sum[j] = 0;
for (int i = 0; i < n; i++) {
int coeff = ((k & e[i]) == 0) ? 1 : -1;
for (int j = 0; j < m; j++)
sum[j] += coeff * a[i][j];
}
int totalSum = 0;
for (int j = 0; j < m; j++)
totalSum += abs(sum[j]);
if (totalSum > ans)
ans = totalSum;
}
cout << ans;
return 0;
}