Pagini recente » Cod sursa (job #1426611) | Cod sursa (job #2567613) | Cod sursa (job #1145054) | Cod sursa (job #3215582) | Cod sursa (job #2399622)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long maxim=0;
int sol[50],v[20][20],n,m,i,j;
long long abs1(long long a)
{
if (a<0)
{
return -a;
}
return a;
}
void afis()
{
int i;
long long sum=0,sum1=0;
for (j=1;j<=m;j++)
{
sum=0;
for (i=1;i<=n;i++)
{
sum+=v[i][j]*sol[i];
}
sum=abs1(sum);
sum1+=sum;
}
maxim=max(maxim,sum1);
}
void back1 (int k)
{int i;
if (k>n)
{
afis();
}
else
{
for (i=-1;i<=1;i+=2)
{
sol[k]=i;
back1(k+1);
}
}
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
{
f>>v[i][j];
}
}
back1(1);
g<<maxim;
return 0;
}