Pagini recente » Cod sursa (job #2186963) | Cod sursa (job #2351679) | Cod sursa (job #817991) | Cod sursa (job #1912830) | Cod sursa (job #1413312)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m;
int v[20][20];
long long int bsum;
void check(){
long long int sum = 0,s = 0;
for(int j = 1; j <= m; j++){
s = 0;
for(int i = 1; i <= n; i++){
s += v[i][j];
}
if(s < 0){
s = -s;
}
sum += s;
}
if(sum > bsum){
bsum = sum;
}
}
void flip(int k){
for(int i = 1; i <= m; i++){
v[k][i] *= -1;
}
}
void beck(int k){
if(k > n){
check();
return;
}
flip(k);
beck(k + 1);
flip(k);
beck(k + 1);
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
fin >> v[i][j];
}
}
beck(1);
fout << bsum;
return 0;
}