Pagini recente » Cod sursa (job #1236847) | Cod sursa (job #1685685) | Cod sursa (job #138261) | Cod sursa (job #2044470) | Cod sursa (job #1362439)
# include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int v[17][17],maxi=-1999999999,n,m;
int p[17];
void calc()
{
int i,t=0,j,s=0;
for (j=1; j<=m; j++)
{
s=0;
for (i=1;i<=n;i++)
{
if (p[i]==0)
{
s+=v[i][j];
}
else
{
s-=v[i][j];
}
}
if (s<0){s=-s;}
t+=s;
}
if (t>maxi)
{
maxi=t;
}
}
void rez(int k)
{
if (k==n+1) calc();
else
{
p[k]=0;
rez(k+1);
p[k]=1;
rez(k+1);
}
}
int main()
{
int i,j;
in>>n>>m;
for (i=1;i<=n;i++) for (j=1;j<=m;j++) in>>v[i][j];
rez(1);
out<<maxi;
return 0;
}