Pagini recente » Cod sursa (job #1507286) | Cod sursa (job #1608770) | Cod sursa (job #1830190) | Cod sursa (job #1568237) | Cod sursa (job #1357020)
#include <iostream>
#include <fstream>
using namespace std;
bool p[17];
int m,n,maxim=-99999999;
int a[17][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+=a[i][j];
}
else
{
s-=a[i][j];
}
}
if (s<0){s=-s;}
t+=s;
}
if (t>maxim)
{
maxim=t;
}
}
void rez(int k)
{
if (k>n)
{
calc();
}
else
{
p[k]=0;
rez(k+1);
p[k]=1;
rez(k+1);
}
}
int main()
{
ifstream in("flip.in");
ofstream out("flip.out");
int i,j;
in>>n;
in>>m;
for (i=1; i<=n; i++)
{
for (j=1; j<=m; j++)
{
in>>a[i][j];
}
}
rez(1);
out<<maxim;
}