Pagini recente » Cod sursa (job #1845866) | Cod sursa (job #811031) | Cod sursa (job #2189719) | Cod sursa (job #1353192) | Cod sursa (job #2670844)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m;
long long a[20][20];
long long coef[20];
long long maxim = INT_MIN;
void Citire()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
fin>>a[i][j];
}
}
}
void Verificare()
{
long long s=0;
for(int i=1;i<=m;i++)
{
long long sa=0;
for(int j=1;j<=n;j++)
{
sa+=(a[j][i]*coef[j]);
}
sa=abs(sa);
s+=sa;
}
maxim = max(maxim, s);
}
void Back(int x)
{
if(x==n+1)
Verificare();
else
{
coef[x]=1;
Back(x+1);
coef[x]=-1;
Back(x+1);
}
}
int main()
{
Citire();
Back(1);
fout<<maxim;
return 0;
}