Pagini recente » Cod sursa (job #1656305) | Cod sursa (job #2255478) | Cod sursa (job #476418) | Cod sursa (job #2422853) | Cod sursa (job #2460178)
#include <fstream>
using namespace std;
ifstream cin("flip.in");
ofstream cout("flip.out");
int usei[18];
int M[18][18];
int usej[18];
int n,m,i,j,maxim;
void coloane()
{
int s=0;
int suma=0;
for(j=1;j<=m;j++)
{
s=0;
for(i=1;i<=n;i++)
s+=M[i][j];
if(s<0)
s*=(-1);
suma+=s;
}
if(suma>maxim)
maxim=suma;
}
void bkt(int k)
{
if(k>n)
{
coloane();
}
else
{
bkt(k+1);
for(j=1;j<=m;j++)
M[k][j]*=(-1);
bkt(k+1);
}
}
int main()
{
cin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>M[i][j];
bkt(1);
cout<< maxim << '\n';
return 0;
}