Pagini recente » Cod sursa (job #2216826) | Cod sursa (job #1593915) | Cod sursa (job #2190157) | Cod sursa (job #3141191) | Cod sursa (job #2714553)
#include <iostream>
#include <fstream>
using namespace std;
int m,n,a[16][16], total=0;
int suma() {
int s=0;
for(int i=0; i<n; i++) {
int ss=0;
for(int j=0; j<m; j++)
ss+=a[i][j];
if(ss<0)
ss *= -1;
s += ss;
}
return s;
}
void back(int col) {
if(col<m) {
back(col+1);
for(int i=0; i<n; i++)
a[i][col] *= -1;
back(col+1);
} else total = max(total, suma());
}
int main() {
ifstream fin("flip.in");
ofstream fout("flip.out");
fin>>n>>m;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
fin>>a[i][j];
back(0);
fout<<total;
return 0;
}