Pagini recente » Cod sursa (job #1095660) | Cod sursa (job #784210) | Cod sursa (job #1923038) | Cod sursa (job #2596715) | Cod sursa (job #628118)
Cod sursa(job #628118)
#include<cstdio>
int m,n,max,sol[20],a[20][20];
int suma(int c)
{
int s;
s=0;
for(int i=1;i<=n;i++)
{
if(sol[i]==true)
s-=a[i][c];
else
s+=a[i][c];
}
if(s<0)
s=-s;
return s;
}
void valid()
{
int s;
s=0;
for(int i=1;i<=m;i++)
s=s+suma(i);
if(s>max)
max=s;
}
void bkt(int p)
{
if(p==n+1)
{ valid(); return;}
sol[p]=false;
bkt(p+1);
sol[p]=true;
bkt(p+1);
}
int main()
{
int i,j;
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a[i][j]);
bkt(1);
printf("%d",max);
return 0;
}