Pagini recente » Cod sursa (job #2273276) | Cod sursa (job #1573139) | Cod sursa (job #1793413) | Cod sursa (job #194053) | Cod sursa (job #1311437)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long l[20],c[20],qw[17][17],n,m,sss;
void col(int pp,long long ss)
{
if(pp==m+1)
{
if(ss>sss) sss=ss;
}
else
{
int s=0;
for(int i=1; i<=n; i++)
s=s+qw[i][pp];
if(s>0)
col(pp+1,ss+s);
else
col(pp+1,ss-s);
}
}
void lin(int pl)
{
if(pl==n+1)
col(1,0);
else
{
lin(pl+1);
for(int i=1; i<=m; i++)
qw[pl][i]=-qw[pl][i];
lin(pl+1);
for(int i=1; i<=m; i++)
qw[pl][i]=-qw[pl][i];
}
}
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
fin>>qw[i][j];
lin(1);
fout<<sss<<'\n';
return 0;
}