Pagini recente » Cod sursa (job #976841) | Cod sursa (job #1904490) | Cod sursa (job #2208205) | Cod sursa (job #1979935) | Cod sursa (job #1615617)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, a[17][17], suma, sumamax, x[50], c[50];
void citire()
{
fin >> n >> m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
fin >> a[i][j];
}
void calculeaza()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
suma += a[i][j] * (x[i]==0?-1:1) * (x[n+j]==0?-1:1);
}
}
}
void bkt(int k)
{
if(k>n+m)
{
suma = 0;
calculeaza();
if(suma > sumamax)
sumamax=suma;
}
else for(int i=0; i<=1; i++)
{
x[k] = i;
bkt(k+1);
}
}
int main()
{
citire();
bkt(1);
fout << sumamax;
return 0;
}