Pagini recente » tema | Cod sursa (job #805049) | Cod sursa (job #1795018) | Cod sursa (job #2347370) | Cod sursa (job #2130467)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int a[101][101], maxum = 0, n, m, st[101];
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 > maxum)
maxum = 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()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
fin >> a[i][j];
bk(1);
fout << maxum;
return 0;
}