Pagini recente » Cod sursa (job #3209480) | Cod sursa (job #262317) | Cod sursa (job #522848) | Cod sursa (job #216259) | Cod sursa (job #2470901)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n, m, v[16][16], maxim = INT_MIN;
void com(int j){
for(int i = 0; i < n; i++){
v[i][j] *= -1;
}
}
void check(){
int S = 0;
for(int i = 0; i < n; i++){
int s = 0;
for(int j = 0; j < m; j++){
s += v[i][j];
}
if(s < 0){
S -= s;
} else{
S += s;
}
}
maxim = max(maxim, S);
}
void bkt(int i){
if(i == m){
check();
return;
}
bkt(i + 1);
com(i);
bkt(i + 1);
com(i);
}
int main(){
in >> n >> m;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
in >> v[i][j];
}
}
bkt(0);
out << maxim;
return 0;
}