Pagini recente » Cod sursa (job #3264527) | Borderou de evaluare (job #1004069) | Cod sursa (job #350911) | Cod sursa (job #605228) | Cod sursa (job #350532)
Cod sursa(job #350532)
#include<cstdlib>
#include<cstdio>
using namespace std;
long long x[17],maxim=-2147483645;
long long a[17][17],n,m,s,tot;
int back(int k)
{s=0;
long i,j,l;
if(k<m)
{x[k]=1;
back(k+1);
x[k]=-1;
back(k+1);
}
else if(k==m)
{s=0;
for(i=0;i<n;i++)
{l=0;
for(j=0;j<m;j++)
l+=a[i][j]*x[j];
s+=abs(l);
}
if(s>maxim) maxim=s;
}
return 0;
}
int main()
{freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d %d",&n,&m);
for (int i=0;i<n;i++)
for (int j=0;j<m;j++)
{scanf("%ld",&a[i][j]);}
back(0);
printf("%ld",maxim);
return 0;
}