Pagini recente » Cod sursa (job #2875093) | Cod sursa (job #1743120) | Cod sursa (job #2895361) | Cod sursa (job #2503176) | Cod sursa (job #2388351)
#include <bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n, m, a[17][17], MX;
int main()
{
in>>n>>m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
in>>a[i][j];
for(int i = 0; i < (1 << n); ++i)
{
int S = 0;
for(int y = 1; y <= m; ++y)
{
int s = 0;
for(int x = 1; x <= n; ++x)
if(i >> (x-1) & 1 == 1)
s -= a[x][y];
else
s += a[x][y];
S += abs(s);
}
MX = max(MX, S);
}
out<<MX;
return 0;
}