Pagini recente » Cod sursa (job #3166425) | Cod sursa (job #2885043) | Cod sursa (job #1989642) | Cod sursa (job #474361) | Cod sursa (job #3191537)
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false); fin.tie(NULL); fout.tie(NULL);
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, sum_max;
int mat[17][17];
int main()
{
fin >> n >> m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
fin >> mat[i][j];
int exp = 1<<(m+1);
for(int i=1; i<=exp; i+=2)
{
bitset <17> b(i);
int sum = 0;
for(int i=1; i<=n; i++)
{
int s = 0;
for(int j=1; j<=m; j++)
if(b[j]==1)
s+=mat[i][j];
else
s-=mat[i][j];
if(s>0)
sum+=s;
else
sum-=s;
}
sum_max = max(sum_max,sum);
}
fout << sum_max;
return 0;
}