Pagini recente » Cod sursa (job #178958) | Cod sursa (job #470958) | Cod sursa (job #1682259) | Cod sursa (job #3192398) | Cod sursa (job #1886788)
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
short n,m;
int a[17][17];
long long smin;
short v[17];
void citire()
{
f>>n>>m;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
f>>a[i][j];
}
void verif()
{
long long sum=0;
for(int i=1;i<=n;++i)
{
long long s1=0,s2=0;
for(int j=1;j<=m;++j)
{
s1+=(a[i][j]*v[j]);
s2+=(a[i][j]*v[j]*(-1));
}
sum+=max(s1,s2);
}
smin=max(smin,sum);
}
void BKTR(short k)
{
if(k==m+1)
verif();
else
{
v[k]=1;
BKTR(k+1);
v[k]=-1;
BKTR(k+1);
}
}
int main()
{
citire();
BKTR(1);
g<<smin;
}