Pagini recente » Cod sursa (job #1005108) | Cod sursa (job #2049802) | Cod sursa (job #1847967) | Cod sursa (job #1544230) | Cod sursa (job #2177392)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,semn[20],sum,maxim;
int Map[20][20];
void Calculeaza() {
sum=0;
for(int i=1; i<=n; i++) {
int clc=0;
for(int j=1; j<=m; j++) {
clc+=Map[i][j]*semn[j];
}
sum+=abs(clc);
}
maxim=max(maxim,sum);
}
void bk(int k) {
if(k==m+1) {
Calculeaza();
return;
}
semn[k]=1;
bk(k+1);
semn[k]=-1;
bk(k+1);
}
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
fin>>Map[i][j];
bk(1);
fout<<maxim;
return 0;
}