Pagini recente » Cod sursa (job #1941138) | Cod sursa (job #1586527) | Cod sursa (job #1679185) | Cod sursa (job #1506597) | Cod sursa (job #2139866)
#include <bits/stdc++.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[101][101],maxx=0,n,m,v[101];
void exec()
{
int gen=0,newo=0;
for(int i=1;i<=n;i++)
{
gen=0;
for(int j=1;j<=m;j++)
gen+=v[j]*a[i][j];
if(gen<0)
gen=-gen;
newo+=gen;
}
if(newo>maxx)
maxx=newo;
}
void bk(int k)
{
if(k>n && k>m)
exec();
else
{
v[k]=1;
bk(k+1);
v[k]=-1;
bk(k+1);
}
}
int main()
{
f >>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
bk(1);
g<<maxx;
}