Pagini recente » Borderou de evaluare (job #1526725) | Cod sursa (job #87972) | Cod sursa (job #2158809) | Cod sursa (job #548880) | Cod sursa (job #3347393)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,i,j,m,x[20][20],sol;
int smax()
{
int s=0,i,j;
for(i=1;i<=n;i++)
{
int t=0;
for(j=1;j<=m;j++)
t+=x[i][j];
if(t<0) t*=-1;
s+=t;
}
return s;
}
void bkt(int k)
{
if(k>m)
{
sol=max(sol,smax());
}
else
{
bkt(k+1);
for(int i=1;i<=n;i++)
x[i][k]*=-1;
bkt(k+1);
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>x[i][j];
bkt(1);
fout<<sol;
return 0;
}