Pagini recente » Cod sursa (job #828938) | Cod sursa (job #797046) | Cod sursa (job #1510342) | Cod sursa (job #261777) | Cod sursa (job #1413546)
#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 17
using namespace std;
int n,m,i,j,p,a[Nmax][Nmax],l,c,s,sol,S;
bool w[Nmax];
int main()
{
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]);
}
for (i=0;i<=(1<<n)-1;i++)
{
s=0; memset(w,false,sizeof(w));
for (j=0;1<<j<=i;j++)
if (i&(1<<j)) w[j]=1;
for (c=1;c<=m;c++)
{
S=0;
for (l=1;l<=n;l++)
if (w[l-1]==true)
S-=a[l][c];
else S+=a[l][c];
if (S<0) S=-S;
s+=S;
}
sol=max(s,sol);
}
printf("%d",sol);
return 0;
}