Pagini recente » Cod sursa (job #2719338) | Cod sursa (job #723899) | Cod sursa (job #2455608) | Cod sursa (job #869218) | Cod sursa (job #65449)
Cod sursa(job #65449)
#include <fstream>
using namespace std;
int n;
int m;
long a[16][16],b[16][16] ;
void citire() {
ifstream in("flip.in");
in >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
in >> a[i][j];
a[i][m] = 1;
}
for (int j = 0; j < m; j++)
a[n][j] = 1;
}
long suma(long a[16][16]) {
long s = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (a[n][j] * a[i][m] == 1){
s += a[i][j];
}
else {
s -= a[i][j];
}
return s;
}
void refac(long b[16][16], long a[16][16]) {
for (int i = 0; i <= n; i++)
for (int j = 0; j <= m; j++)
a[i][j] = b[i][j];
}
void schimba_linie (int l) {
for (int i = 0; i < m; i++)
a[l][i] = -a[l][i];
}
void schimba_coloana (int c) {
for (int i = 0; i < n; i++)
a[i][c] = -a[i][c];
}
long actiune() {
long sm = suma(a);
refac(a, b);
long max = (1 << (n + m));
for (long x = 0; x < max; x++) {
long s = 0;
for (int i = 0; i < n; i++)
if (x & (1 << i))
// schimba_linie(i);
a[i][m] = -1;
for (int i = n; i < n + m; i++)
if (x & (1 << i))
// schimba_coloana(i - n);
a[n][i - n] = -1;
s = suma(a);
if (s > sm)
sm = s;
refac(b, a);
}
return sm;
}
int main() {
citire();
ofstream out("flip.out");
out << actiune();
out.close();
return 0;
}