Pagini recente » Cod sursa (job #3233783) | Cod sursa (job #3169765) | Cod sursa (job #1881604) | Cod sursa (job #2606799) | Cod sursa (job #3279178)
#include <bits/stdc++.h>
using namespace std;
int n,m;
#define ll long long
int main(){
ios::sync_with_stdio(0); cin.tie(0);
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
cin>>n>>m;
vector<vector<int>> v(n,vector<int>(m));
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
cin>>v[i][j];
}
}
ll suma=0,ans=LLONG_MIN;
for(int mask=0;mask<(1<<n);++mask){
ll sum,tot=0;
for(int j=0;j<m;++j){
sum=0;
for(int i=0;i<n;++i){
sum+=(mask & (1<<i))? - v[i][j]: v[i][j];
}
tot+=max(sum,-sum);
}
ans=max(ans,tot);
}
cout<<ans;
return 0;
}