Pagini recente » Cod sursa (job #1231547) | Cod sursa (job #2051984) | Cod sursa (job #1041581) | Cod sursa (job #711687) | Cod sursa (job #634173)
Cod sursa(job #634173)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[16][16],n,m,maxim=0,st[17][17],sol[17];
void suma()
{
int s,sum=0;
for (int j=0;j<m;j++)
{
s=0;
for (int i=0;i<n;i++)
{
if (sol[i])
{ s-=a[i][j]; }
else
{ s+=a[i][j]; }
}
if (s<0)
{ s=s*(-1); }
sum+=s;
}
if (sum>maxim)
maxim=sum;
}
void back(int k)
{
int i;
for (i=0;i<=1;i++)
{
sol[k]=i;
if (k==n)
suma();
else
back(k+1);
}
}
int main()
{
int i,j;
f>>n>>m;
for (i=0;i<n;i++)
for (j=0;j<m;j++)
f>>a[i][j];
back(1);
g<<maxim<<'\n';
f.close();
g.close();
return 0;
}