Pagini recente » Cod sursa (job #1346799) | Cod sursa (job #2786104) | Cod sursa (job #438239) | Cod sursa (job #1955828) | Cod sursa (job #2465617)
#include <bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n,m,v[20][20],c[20],s[20],ma;
void read()
{
in >> n >> m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{
in >> v[i][j];
c[j]+=v[i][j];
}
}
int vf()
{
int sum=0;
for(int i=1; i<=n; i++)
{
int su=0;
for(int j=1; j<=m; j++)
{
su+=s[j]*v[i][j];
}
sum+=abs(su);
}
return sum;
}
void bac(int poz)
{
if(poz==m+1)
{
ma=max(ma,vf());
return;
}
s[poz]=1;
bac(poz+1);
s[poz]=-1;
bac(poz+1);
}
int main()
{
read();
bac(1);
out << ma;
return 0;
}