Pagini recente » Cod sursa (job #2458117) | Cod sursa (job #856721) | Cod sursa (job #343464) | Cod sursa (job #2470090) | Cod sursa (job #133651)
Cod sursa(job #133651)
#include<stdio.h>
#include<math.h>
long v[16][16],max,maxset=0;
int m,n;
void flip()
{
long long i,j,k,l,a,c,sum,lin,pows[16],fli[16];
a=int(pow(2,n));
for(i=0;i<16;i++) {pows[i]=int(pow(2,i));}
for(i=0;i<a;i++)
{
for(j=0;j<n;j++)
{
if((i & pows[j])==pows[j]){fli[j]=1;}else{fli[j]=0;}
}
sum=0;
for(j=0;j<m;j++)
{
lin=0;
for(k=0;k<n;k++)
{
if(fli[k]==0){lin+=v[j][k];}else{lin-=v[j][k];}
}
if(lin<0){sum-=lin;}else{sum+=lin;}
}
if(maxset==0 || sum>max){maxset=1; max=sum;}
}
}
void cit()
{
int i,j;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%ld",&v[i][j]);
}
}
}
void afis()
{
printf("%lld",max);
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
cit();
flip();
afis();
fclose(stdin);
fclose(stdout);
}