Pagini recente » Cod sursa (job #2160488) | Cod sursa (job #2106144) | Cod sursa (job #1845920) | Cod sursa (job #1189485) | Cod sursa (job #3195738)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
#define cin fin
#define cout fout
long long X[20], A[20][20], n, m, maxi = -1;
void ComputeSum(){
long long sum, rez = 0;
for(int j = 1; j <= m; ++j){
sum = 0;
for(int i = 1; i <= n; ++i)
sum += X[i] * A[i][j];
rez += abs(sum);
}
if(rez > maxi)
maxi = rez;
}
void Back(int k){
if(k > n)
ComputeSum();
else {
X[k] = 1;
Back(k + 1);
X[k] = -1;
Back(k + 1);
}
}
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
cin >> A[i][j];
Back(1);
cout << maxi;
return 0;
}