Pagini recente » Cod sursa (job #1911254) | Cod sursa (job #976390) | Istoria paginii runda/preojii/clasament | Cod sursa (job #440381) | Cod sursa (job #1788380)
#include <stdio.h>
using namespace std;
unsigned long long int a[17][17],maxim;
int n,m,s[17];
void comuta()
{
int st=0,sl;
for(int i=1;i<=m;i++)
{
sl=0;
for(int j=1;j<=n;j++)
sl=sl+s[j]*a[j][i];
if(sl<0)
sl=-sl;
st=st+sl;
}
if(st>maxim)
maxim=st;
}
void back(int k)
{
if(k>n)
comuta();
else
{
s[k]=1;
back(k+1);
s[k]=-1;
back(k+1);
}
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%llu",&a[i][j]);
back(1);
printf("%d",maxim);
}