Pagini recente » Cod sursa (job #219299) | Cod sursa (job #2981254) | Cod sursa (job #2175766) | Cod sursa (job #527653) | Cod sursa (job #1978805)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long maxx,x[20][20],n,m,s,c,a[20];
void suma()
{
for(int j=1;j<=m;j++)
{
c=0;
for(int i=1;i<=n;i++)
c=c+a[i]*x[i][j];
if(c<0)
c=-c;
s=s+c;
}
if(s>maxx)
maxx=s;
}
void back(int i)
{
if(i>n)
suma();
else
{
a[i]=1;
back(i+1);
a[i]=-1;
back(i+1);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>x[i][j];
back(1);
g<<maxx;
return 0;
}