Pagini recente » Cod sursa (job #1357144) | Cod sursa (job #2542326) | Cod sursa (job #473795) | Cod sursa (job #3126103) | Cod sursa (job #2147824)
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[1000][1000],sumaTotala = 0,semn[20],ocupat[20],m,n,maxim = 0,b[20];
void BK(int k)
{
if(k > m)
{
maxim = 0;
for(int i = 1;i <= n;i++)
{
int suma = 0;
for(int j = 1;j <= m;j++)
suma += a[i][j] * semn[j];
maxim = maxim + abs(suma);
}
if(maxim > sumaTotala)
sumaTotala = maxim;
}
else
{
semn[k] = 1;
BK(k+1);
semn[k] = -1;
BK(k+1);
}
}
int main()
{
f>>n>>m;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m;j++)
f>>a[i][j];
BK(1);
g<<sumaTotala;
return 0;
}