Pagini recente » Cod sursa (job #1961787) | Cod sursa (job #3352319) | Cod sursa (job #2456934) | Cod sursa (job #2349684) | Cod sursa (job #3304411)
#include <bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n,m,ans;
int mat[18][18];
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
in>>mat[i][j];
}
}
for(int k=0;k<(1<<m);k++){
int sum=0;
for(int i=1;i<=n;i++){
int sum_lin=0;
for(int j=1;j<=m;j++){
if((k&(1<<(j-1)))>0){
sum_lin-=mat[i][j];
}else{
sum_lin+=mat[i][j];
}
}
if(sum_lin<0){
sum_lin=-sum_lin;
}
sum+=sum_lin;
}
ans=max(ans,sum);
}
out<<ans;
return 0;
}