Pagini recente » Cod sursa (job #1214338) | Cod sursa (job #95304) | Cod sursa (job #293715) | Cod sursa (job #862299) | Cod sursa (job #2410247)
#include <bits/stdc++.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n, m, i, smax, j, v[32][32];
void sum()
{
int s = 0, sum = 0, i, j;
for(i = 1; i <= n; i++)
{
for(s = 0, j = 0; j <= m; j++)
s += v[i][j];
sum += abs(s);
}
smax = max(sum, smax);
}
void back(int k)
{
if(k > m) sum();
else
{
for(int i = 1; i <= n; i++)
v[i][k] = -v[i][k];
back(k + 1);
for(int i = 1; i <= n; i++)
v[i][k] = -v[i][k];
back(k + 1);
}
}
int main()
{
f >> n >> m;
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
f >> v[i][j];
back(1);
g << smax;
return 0;
}