Pagini recente » Cod sursa (job #1801019) | Cod sursa (job #268346) | Cod sursa (job #2297791) | Cod sursa (job #3326474) | Cod sursa (job #3315922)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, v[17][17], k, out;
bool flip[17];
void calc(){
int sumacurenta=0, sumalinie=0;
for(int i=1; i<=n; i++){
sumalinie=0;
for (int j=1; j<=m; j++){
if (flip[j]) sumalinie-=v[i][j];
else sumalinie+=v[i][j];
}
sumacurenta += abs(sumalinie);
}
out=max(out, sumacurenta);
}
void bkt(int k){
if (k==m+1){
calc();
return;
}
flip[k]=0;
bkt(k+1);
flip[k]=1;
bkt[k+1];
}
int main(){
fin>>n, m;
for(int i=1; i<=n; i++)for(int j=1; j<=m; j++) cin>>v[i][j];
bkt(1);
fout<<out;
return 0;
}