Pagini recente » Cod sursa (job #279225) | Cod sursa (job #2267234) | Cod sursa (job #2745744) | Cod sursa (job #2887879) | Cod sursa (job #1165813)
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int m,n,k,t[20][20],sol[20],best=0,i,j;
void calcul()
{
int s1,s=0;
for(i=1;i<=n;i++)
{
s1=0;
for(j=1;j<=m;j++)
s1=s1+t[i][j]*sol[j];
s=s+max(s1,-s1);
}
best=max(s,best);
}
void f(int k)
{
if(k==m+1)
{
calcul();
return;
}
sol[k]=-1;
f(k+1);
sol[k]=1;
f(k+1);
}
int main()
{
in>>n>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
in>>t[i][j];
}
f(1);
out<<best<<endl;
return 0;
}