Pagini recente » Cod sursa (job #2804728) | Cod sursa (job #2909589) | Cod sursa (job #1948608) | Cod sursa (job #1223138) | Cod sursa (job #1829578)
#include <iostream>
#include <fstream>
#include <limits.h>
#include <algorithm>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[18][18],sum,s,maxim=INT_MIN,lim;
int flip()
{
sum=0;
for(int i=1;i<=n;++i)
{
s=0;
for(int j=1;j<=m;++j)
s+=-a[0][j]*a[i][j];
if(s>=0) sum+=s;
else sum+=-s;
}
return sum;
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
f>>a[i][j];
lim=1<<m;
for(int i=1;i<=lim;++i)
{
for(int j=1;j<=m;++j)
{
if(i&(1<<(j-1)))
a[0][j]=-1;
else a[0][j]=1;
}
maxim=max(maxim,flip());
}
g<<maxim;
return 0;
}