Pagini recente » Cod sursa (job #609310) | Cod sursa (job #43370) | Cod sursa (job #708683) | Cod sursa (job #3184705) | Cod sursa (job #1864684)
#include <fstream>
#include <iostream>
#include <stdlib.h>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n, m, s[17], a[17], v[17][17];
int sumAbs, sumMax = -INF, sumFlip;
void display_sol(int k){
sumFlip = 0;
for(int i=1; i<=n; ++i){
sumAbs = 0;
for(int j=1; j<=m; ++j){
if(a[j]) sumAbs -= v[i][j];
else sumAbs += v[i][j];
}
sumFlip += abs(sumAbs);
}
if(sumFlip > sumMax) sumMax = sumFlip;
}
void backtracking(int k)
{
for(s[k]=s[k-1]+1; s[k]<=m; s[k]++)
{
a[s[k]] = 1;
display_sol(k);
backtracking(k+1);
a[s[k]] = 0;
}
}
int main()
{
f >> n >> m;
for(int i=1; i<=n; ++i){
for(int j=1; j<=m; ++j){
f >> v[i][j];
}
}
backtracking(1);
g << sumMax << '\n';
}