Pagini recente » Cod sursa (job #295724) | Cod sursa (job #858287) | Istoria paginii runda/pt_round12 | Cod sursa (job #1028782) | Cod sursa (job #2200880)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m;
long long a[20][20],i,j,val[20],sumx,sum,s,k;
void bkt(int k)
{
if(k>m)
{ sum=0;
for(i=1;i<=n;i++)
{
s=0;
for(j=1;j<=m;j++)
s=s+a[i][j]*val[j];
if(s<0)s=s*(-1);
sum=sum+s;
}
if(sum>sumx)sumx=sum;
}else
{val[k]=1;
bkt(k+1);
val[k]=-1;
bkt(k+1);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
bkt(1);
g<<sumx;
}