Pagini recente » Cod sursa (job #1678058) | Cod sursa (job #2594473) | Cod sursa (job #1542578) | Cod sursa (job #2196484) | Cod sursa (job #2043527)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int a[17][17],i,j,n,m,Semn[40],rez;
int suma()
{
int i,j,sum=0,sol=0;
for(i=1;i<=n;i++)
{
sum=0;
for(j=1;j<=m;j++)
sum+=Semn[j]*a[i][j];
sol+=max(sum,-sum);
}
return sol;
}
void backtrack(int poz)
{
if(poz==m+1)
{
rez=max(rez,suma());
return ;
}
Semn[poz]=1;
backtrack(poz+1);
Semn[poz]=-1;
backtrack(poz+1);
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
fin>>a[i][j];
rez+=a[i][j];
}
backtrack(1);
fout<<rez;
}