Pagini recente » Istoria paginii runda/ten1 | Cod sursa (job #1239003) | Cod sursa (job #483238) | Cod sursa (job #1909617) | Cod sursa (job #1615622)
#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] * x[n+j];
}
}
}
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==0?-1:1);
bkt(k+1);
}
}
int main()
{
citire();
bkt(1);
fout << sumamax;
return 0;
}