Pagini recente » Cod sursa (job #2866573) | Cod sursa (job #1020650) | Cod sursa (job #2148195) | Cod sursa (job #1555752) | Cod sursa (job #1161126)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n, m;
long a[20][20], best, sc[20];
void calcul()
{
long nr,sum=0;
for(int i=1;i<=n;i++)
{
nr=0;
for(int j=1;j<=m;j++)
nr =nr+ a[i][j] * sc[j];
sum = sum+max(nr,-nr);
}
best = max(best,sum);
}
void BK(int k)
{
if(k==m+1){calcul();return;}
sc[k]=-1;
BK(k+1);
sc[k]=1;
BK(k+1);
}
int main()
{
int i,j;
in>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
in>>a[i][j];
BK(1);
out<< best;
return 0;
}