Pagini recente » Cod sursa (job #3133024) | Cod sursa (job #2309093) | Cod sursa (job #2142402) | Cod sursa (job #1646953) | Cod sursa (job #3262911)
#include<bits/stdc++.h>
using namespace std;
ifstream fcin("flip.in");
ofstream fcout("flip.out");
const int N = 20;
int v[N][N], p[N];
int n, m;
int main()
{
int x, rasp;
fcin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 0; j < m; j++)
fcin >> v[i][j];
x = (1 << m);
rasp = INT_MIN;
for (int i = 0; i < x; i++)
{
for (int j = 0; j < m; j++)
p[j] = ((i >> j) & 1);
int stotal = 0;
for (int k = 1; k <= n; k++)
{
int s = 0;
for (int j = 0; j < m; j++)
if (p[j] == 0)
s += v[k][j];
else
s -= v[k][j];
if (s < 0)
s = -s;
stotal += s;
}
rasp = max(rasp, stotal);
}
fcout << rasp;
return 0;
}