Pagini recente » Cod sursa (job #1215053) | Cod sursa (job #1819344) | Cod sursa (job #2362544) | Cod sursa (job #941638) | Cod sursa (job #416832)
Cod sursa(job #416832)
#include <stdio.h>
#define nmax 20
long max=-100000000;
int n,m;
long v[nmax][nmax];
int st[nmax];
long abs(long x)
{
if (x>0) return x;
return -x;
}
void calcul()
{
long s=0,sp;
for (int i=1;i<=m;i++)
{
sp=0;
for (int j=1;j<=n;j++)
{
if (st[j]==1)
sp+=v[j][i];
else
sp-=v[j][i];
}
s+=abs(sp);
}
if (s>max) max=s;
}
void back(int niv)
{
for (int i=1;i<=2;i++)
{
st[niv]=i;
if (niv<n) back(niv+1);
else calcul();
}
}
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("%ld",&v[i][j]);
back(1);
printf("%ld",max);
return 0;
}