Pagini recente » Cod sursa (job #1100694) | Cod sursa (job #1128457) | Cod sursa (job #2544902) | Cod sursa (job #1462737) | Cod sursa (job #2162354)
#include <bits/stdc++.h>
#define nmax 18
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n, m, f[17][17], smax, sact, slin, com[nmax*nmax];
void citire()
{
in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++) in>>f[i][j];
in.close();
}
void rezolvare()
{
sact=0;
for(int i=1;i<=n;i++)
{
slin=0;
for(int j=1;j<=m;j++)
slin+=f[i][j]*com[j];
if(slin<0) slin*=-1;
sact+=slin;
}
if(sact>smax) smax=sact;
}
void bkt(int k)
{
if(k>n&&k>m)
rezolvare();
else
{
com[k]=1;
bkt(k+1);
com[k]=-1;
bkt(k+1);
}
}
int main()
{
citire();
bkt(1);
out<<smax;
return 0;
}