Pagini recente » Cod sursa (job #260356) | Diferente pentru problema/interact intre reviziile 47 si 48 | Cod sursa (job #15907) | Borderou de evaluare (job #1799918) | Cod sursa (job #20541)
Cod sursa(job #20541)
#include<stdio.h>
#define dim 101
long n,m,a[dim][dim],smax;
long i,j,k,s,t;
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%lu %lu",&n ,&m);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%lu", a[i]+j);
for(i=0;i<(1<<m);i++)
{
s=0;
for(k=0;k<n;k++)
{
for(t=j=0;j<m;j++)
if(i&(1<<j))
t+=-a[k][j];
else
t+=a[k][j];
s+=t<-t ? -t : t;
}
if(smax<s)
smax=s;
}
printf("%lu\n",smax);
return 0;
}