Pagini recente » Cod sursa (job #1233607) | Cod sursa (job #2720339) | Cod sursa (job #1623388) | Cod sursa (job #1784561) | Cod sursa (job #2041030)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],m,n,sol=-1000000000,s[20];
int get_sol()
{
int sum,ret=0;
for(int i=1;i<=n;i++)
{
sum=0;
for(int j=1;j<=m;j++)
sum+=s[j]*a[i][j];
ret+=max(sum,-sum);
}
return ret;
}
void bkt(int c)
{
if(c==m)
{
sol=max(sol,get_sol());
return;
}
s[c]=1;bkt(c+1);
s[c]=-1;bkt(c+1);
}
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
f>>a[i][j];
s[1]=1;
bkt(2);
g<<sol;
return 0;
}