Pagini recente » Cod sursa (job #1996237) | Cod sursa (job #2630266) | Cod sursa (job #1768682) | Cod sursa (job #1817082) | Cod sursa (job #2765609)
#include<fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,a[17][17];
int sumMax;
int x[35];
void CalcSuma()
{
int i,j,sum=0,s=0;
for(j=1;j<=m;j++)
{
s=0;
for(i=1;i<=n;i++)
{
if((x[i]==1 && x[j+n]==1) || (x[i]==0 && x[j+n]==0))
s=s+a[i][j];
else
s=s+a[i][j]*(-1);
}
if(s<0)
s=-s;
sum=sum+s;
}
if(sum>sumMax)
sumMax=sum;
}
void Backtracking(int k)
{
if(k>n)
CalcSuma();
else
{
int i;
for(i=0;i<=1;i++)
{
x[k]=i;
Backtracking(k+1);
}
}
}
int main()
{
int i,j;
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
Backtracking(1);
fout<<sumMax;
fin.close();
fout.close();
return 0;
}