Pagini recente » Cod sursa (job #1936868) | Cod sursa (job #3349927) | Cod sursa (job #3299930) | Cod sursa (job #101988) | Cod sursa (job #3324818)
#include <bits/stdc++.h>
using namespace std;
int mat[20][20], s[20], v[20];
int n, m, maxs=0;
void rec(int x)
{
if(x==n+1)
{
int sum=0;
memset(s, 0, sizeof(s));
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(v[i]==1)
s[j]-=mat[i][j];
else
s[j]+=mat[i][j];
}
}
for(int i=1; i<=m; i++)
sum+=max(s[i], s[i]*(-1));
maxs=max(maxs, sum);
return;
}
rec(x+1);
v[x]=1;
rec(x+1);
v[x]=0;
return;
}
int main()
{
ifstream cin("flip.in");
ofstream cout("flip.out");
cin>>n>>m;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
cin>>mat[i][j];
}
rec(1);
cout<<maxs;
return 0;
}