Pagini recente » Cod sursa (job #241382) | Cod sursa (job #532656) | Cod sursa (job #2852064) | Cod sursa (job #3172298) | Cod sursa (job #1211045)
#include <fstream>
#include<iostream>
using namespace std;
int m,n,a[16][16],v[20],maxim,sc,s;
void sol(int k)
{
int i,j;
s=0;
if (k==m)
{
s=0;
for (i=0;i<n;i++)
{
sc=0;
for (j=0;j<m;j++)
{
sc=sc+a[i][j]*v[j];
}
if (sc<0)
sc=sc*(-1);
s=s+sc;
}
if (s>maxim)
maxim=s;
}
else
{
v[k]=1;
sol(k+1);
v[k]=-1;
sol(k+1);
}
}
int main()
{
int i,j;
ifstream in;in.open("flip.in");
ofstream o;o.open ("flip.out", ofstream::out);
in>>n;in>>m;s=sc=maxim=0;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
in>>a[i][j];
sol(0);
o<<maxim;
in.close();o.close();
return 0;
}