Pagini recente » Cod sursa (job #1453345) | Cod sursa (job #389364) | Cod sursa (job #1344285) | Cod sursa (job #2190972) | Cod sursa (job #1427768)
#include <fstream>
using namespace std;
long ans = 0, t[16][16];
int n, m;
void bt(int poz, bool inm[16]) {
if (poz == n) {
int aux[16][16];
for (int i = 0; i < n; i++)
if (inm[i])
for (int j = 0; j < m; j++)
aux[i][j] = -t[i][j];
else
for (int j = 0; j < m; j++)
aux[i][j] = t[i][j];
long s = 0;
for (int j = 0; j < m; j++) {
long sp = 0;
for (int i = 0; i < n; i++)
sp += aux[i][j];
s += (sp > 0) ? sp : -sp;
}
if (s > ans)
ans = s;
return;
}
bt(poz + 1, inm);
inm[poz] = true;
bt(poz + 1, inm);
imn[poz] = false;
}
int main() {
ifstream fi("flip.in");
ofstream fo("flip.out");
fi >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
fi >> t[i][j];
bool inm[16];
for (int i = 0; i < n; i++)
inm[i] = false;
bt(0, inm);
fo << ans;
return 0;
}