Pagini recente » Cod sursa (job #1230969) | Cod sursa (job #2743714) | Cod sursa (job #1924097) | Cod sursa (job #171099) | Cod sursa (job #2270974)
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n,m,a[20][20],f[20],s,maxi;
void backtraking(int k)
{ if(k==m)
{ int s=0;
for(int i=1;i<=n;i++)
{ int t=0;
for(int j=1;j<=m;j++)
if(f[j])
t+=-a[i][j];
else
t+=a[i][j];
if(t>=0)
s+=t;
else
s+=-t;
}
if(maxi<s)
maxi=s;
return;
}
f[k]=0;
backtraking(k+1);
f[k]=1;
backtraking(k+1);
}
int main()
{ in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
in>>a[i][j];
backtraking(0);
out<<maxi;
return 0;
in.close();
out.close();
return 0;
}