Pagini recente » Cod sursa (job #855762) | Cod sursa (job #779697) | Cod sursa (job #2374477) | Cod sursa (job #523768) | Cod sursa (job #2151007)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[25][25], rez = 0, n, m, st[25*25];
void exec()
{
int genSum = 0, newSum = 0;
for(int i = 1; i <= n; i++)
{
genSum = 0;
for(int j = 1; j <= m; j++)
genSum += st[j] * a[i][j];
if(genSum < 0)
genSum = -genSum;
newSum += genSum;
}
if(newSum > rez)
rez = newSum;
}
void bk(int k)
{
if(k > n && k > m)
exec();
else
{
st[k] = 1;
bk(k + 1);
st[k] = -1;
bk(k + 1);
}
}
int main()
{
f >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
f >> a[i][j];
bk(1);
g << rez;
return 0;
}