Pagini recente » Cod sursa (job #418140) | Cod sursa (job #2749895) | Cod sursa (job #2197341) | Cod sursa (job #2206144) | Cod sursa (job #2776472)
#include <fstream>
#include <iostream>
#include <cstring>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
void print(int v[])
{
for (int i = 1; v[i]; i++)
fout << v[i] << " ";
fout << "\n";
}
int mat[18][18], n, m, sum, ans, pr[18][18];
int v[36];
void backt(int pas)
{
if (pas == n + m + 1)
return ;
for (int i = v[pas - 1] + 1; i <= n + m; i++)
{
sum = 0;
v[pas] = i;
for (int j = 1; v[j]; j++)
if (v[j] <= n)
for (int k = 1; k <= m; k++)
pr[v[j]][k] *= -1;
else
for (int k = 1; k <= n; k++)
pr[k][v[j] - n] *= -1;
for (int i1 = 1; i1 <= n; i1++)
for (int j1 = 1; j1 <= m; j1++)
{
sum += pr[i1][j1];
if (pr[i1][j1] != mat[i1][j1])
pr[i1][j1] = mat[i1][j1];
}
ans = max(ans, sum);
backt(pas + 1);
}
v[pas] = 0;
}
int main()
{
int i, j;
fin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
{
fin >> mat[i][j];
sum += mat[i][j];
pr[i][j] = mat[i][j];
}
ans = sum;
backt(1);
fout << ans;
}