Pagini recente » Cod sursa (job #2467821) | Cod sursa (job #2467833) | Cod sursa (job #243625) | Cod sursa (job #3214634) | Cod sursa (job #1746432)
#include <iostream>
#include <cstdio>
#define NMAX 17
using namespace std;
int N,M;
int a[NMAX][NMAX];
void citire()
{
scanf("%d%d",&N,&M);
for(int i=1; i<=N; i++)
for(int j=1; j<=M; j++)
scanf("%d",&a[i][j]);
}
int v[NMAX],smax;
void rezolvare()
{
for(int x=0; x<(1<<N); x++)
{
for(int i=1; i<=M; i++)
v[i]=0;
for(int i=0; i<N; i++)
{
int p=1;
if(x>>i&1)
p=-1;
for(int j=1;j<=M;j++)
v[j]+=p*a[i+1][j];
}
int s=0;
for(int i=1;i<=M;i++)
s+=v[i]>0?v[i]:-v[i];
if(s>smax)
smax = s;
}
cout<<smax;
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
citire();
rezolvare();
return 0;
}