Pagini recente » Cod sursa (job #2675766) | Cod sursa (job #387980) | Cod sursa (job #1051787) | Cod sursa (job #1131122) | Cod sursa (job #346836)
Cod sursa(job #346836)
#include<stdio.h>
int n,m,a[17][17],x[17],sol,sl,sm,i,j;
void read(),solve(),back(int c);
int main()
{
read();
solve();
return 0;
}
void read()
{
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]);
}
void solve()
{
x[1]=1;
back(2);
printf("%d\n",sol);
}
void back(int c)
{
if(c==m+1)
{
sm=0;
for(i=1;i<=n;i++)
{
sl=0;
for(j=1;j<=m;j++)
sl+=x[j]*a[i][j];
sl=sl>=0?sl:-sl;
sm+=sl;
}
sol=sol>sm?sol:sm;
return;
}
x[c]=1;back(c+1);
x[c]=-1;back(c+1);
}