Pagini recente » Cod sursa (job #1090903) | Cod sursa (job #1169342) | Cod sursa (job #1906661) | Cod sursa (job #650475) | Cod sursa (job #2631786)
#include <bits/stdc++.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
vector<vector<int>> v;
int n, m;
long long maxim = LLONG_MIN;
int main()
{
f >> n >> m;
v.resize(n, vector<int>(m));
for (auto &i : v)
for (auto &j : i)
f >> j;
for (long long t = 0; t < (1ll << (n)); t++)
{
long long ax = 0;
for (int j = 0; j < m; j++)
{
long long ax2 = 0;
for (int i = 0; i < n; i++)
if (t & (1ll << i))
ax2 += v[i][j];
else
ax2 -= v[i][j];
ax += abs(ax2);
}
maxim = max(maxim, ax);
}
g << maxim;
return 0;
}