Pagini recente » Cod sursa (job #2737906) | Cod sursa (job #1671942) | Cod sursa (job #2648660) | Cod sursa (job #1707106) | Cod sursa (job #1162424)
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int m,n,k;
long t[20][20],sol[20],best=0;
void calc()
{
int suma,i,j;
long s=0;
for(i=1;i<=n;i++)
{suma=0;
for(j=1;j<=m;j++)
suma=suma+t[i][j]*sol[j];
s=s+max(suma,-suma);
}
best=max(s,best);
}
void bk(int k)
{
if(k==m+1) {calc();return;}
sol[k]=-1;
bk(k+1);
sol[k]=1;
bk(k+1);
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
in>>t[i][j];
bk(1);
out<<best<<endl;
return 0;
}