Pagini recente » Cod sursa (job #1264303) | Cod sursa (job #1701891) | Cod sursa (job #1287300) | Cod sursa (job #1783096) | Cod sursa (job #1003470)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("flip.in");
ofstream g ("flip.out");
int n, m, s, smax;
int v[17][17], st[17];
void citeste ()
{
f>>n>>m;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++) f>>v[i][j];
}
int modul (int x)
{
if (x>0) return x;
return -x;
}
void back (int k)
{
int i, j, s, t;
if (k==m+1)
{
s=0;
for (int i=1; i<=n; i++){t=0;
for (int j=1; j<=m; j++)
if (st[j]) t+=-v[i][j];
else t=t+v[i][j];
s=s+modul (t);
}
if (smax<s) smax=s;
}
else
{
st[k]=0; back (k+1);
st[k]=1; back (k+1);
}
}
int main ()
{
citeste ();
back (1);
g<<smax<<'\n';
return 0;
}