Pagini recente » Cod sursa (job #2658071) | Cod sursa (job #1940781) | Cod sursa (job #661428) | Cod sursa (job #866720) | Cod sursa (job #2884668)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long n,m,ma[20][20],maxx,v[20];
void calculeaza()
{
long long i,j,calc,suma=0;
for(i=1; i<=n; i++)
{
calc=0;
for(j=1; j<=m; j++)
calc=calc+v[j]*ma[i][j];
if(calc<0)
calc=-calc;
suma=suma+calc;
}
maxx=max(maxx,suma);
}
void back(int k)
{
if(k>m)
calculeaza();
else
{
v[k]=1;
back(k+1);
v[k]=-1;
back(k+1);
}
}
int main()
{
int i,j;
fin>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
fin>>ma[i][j];
maxx+=ma[i][j];
}
back(1);
fout<<maxx;
fin.close();
fout.close();
return 0;
}