Pagini recente » Cod sursa (job #1191186) | Cod sursa (job #1148792) | Cod sursa (job #2634774) | Cod sursa (job #1790375) | Cod sursa (job #1490417)
#include <cstdio>
using namespace std;
bool folosit[20];
int mat[20][20],sol[20];
int k,n,m,max;
int fc()
{
int i,j,s=0,sum=0;
for(i=1;i<=k;i++)
{
for(j=1;j<=m;j++)
mat[sol[i]][j]=-mat[sol[i]][j];
}
for(j=1;j<=m;j++)
{
s=0;
for(i=1;i<=n;i++)
{
s=s+mat[i][j];
}
if(s<0)
{
sum=sum-s;
}
else
sum=sum+s;
}
if(sum>max)
max=sum;
}
void bkt(int p)
{
if(p-1==k)
fc();
else
{
for(int i=sol[p-1];i<=n;i++)
{
sol[p]=i;
if(folosit[i]==0)
{
folosit[i]=1;
bkt(p+1);
folosit[i]=0;
}
}
}
}
int main()
{
FILE *in,*out;
in=fopen("flip.in","r");
out=fopen("flip.out","w");
int i,j;
fscanf(in,"%d%d",&n,&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
fscanf(in,"%d",&mat[i][j]);
}
for(k=1;k<=n;k++)
{
bkt(1);
}
fprintf(out,"%d",max);
return 0;
}