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