Pagini recente » Cod sursa (job #658390) | Cod sursa (job #1590548) | Cod sursa (job #1224039) | Cod sursa (job #1230074) | Cod sursa (job #191615)
Cod sursa(job #191615)
#include<stdio.h>
int sol[10001],n,m;
long a[17][17],max=-1000000;
void read()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%ld",&a[i][j]);
}
void calculeaza()
{
int s=0,k,j,x;
for (j=1; j<=m; j++)
{x=0;
for (k=1; k<=n; k++)
x=x+sol[k]*a[k][j];
if (x<0)
s=s-x;
else
s=s+x;
}
if (s>max)
max=s;
}
void print()
{
printf("%ld",&max);
}
void back(int k)
{
if(k==n+1)
calculeaza();
else
for(int val=-1;val<=1;val+=2)
{
sol[k]=val;
back(k+1);
}
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
read();
back(1);
print();
}