Pagini recente » Cod sursa (job #242028) | Cod sursa (job #1992663) | Cod sursa (job #1371533) | Cod sursa (job #57804) | Cod sursa (job #772446)
Cod sursa(job #772446)
#include <stdio.h>
#include <stdlib.h>
#define NMAX 100;
int v[25],n,mat[10][10],b[10][10],k,l,suma_max=0;
void citire_mat()
{
scanf("%d %d",&k,&l);
int i,j;
for(i=1;i<=k;i++)
for(j=1;j<=l;j++)
{
scanf("%d",&mat[i][j]);
suma_max+=mat[i][j];
}
n=k+l;
}
void cop_b()
{
int i,j;
for(i=1;i<=k;i++)
for(j=1;j<=l;j++)
b[i][j]=mat[i][j];
}
void suma()
{
int s=0;
int i,j;
for(i=1;i<=k;i++)
for(j=1;j<=l;j++)
s+=b[i][j];
if(s>suma_max)
suma_max=s;
}
void init_vector()
{
int i;
scanf("%d", &n);
for(i=1;i<=n;i++)
v[i]=0;
}
void flip(int p)
{
int i,j;
cop_b();
for(j=1;j<=p;j++)
if(v[j]<=k)
for(i=1;i<=l;i++)
b[v[j]][i]=-b[v[j]][i];
else
for(i=1;i<=k;i++)
b[i][v[j]-k]=-b[i][v[j]-k];
suma();
}
int valid(int p)
{
return 1;
}
void back(int p)
{
int k;
for(k=v[p-1]+1;k<=n;k++)
{
v[p]=k;
if(valid(p))
{
flip (p);
back(p+1);
}
}
}
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
citire_mat();
init_vector();
back(1);
printf("%d", suma_max);
return 0;
}