Pagini recente » Cod sursa (job #1384759) | Cod sursa (job #1166437) | Cod sursa (job #1311142) | Cod sursa (job #2758873) | Cod sursa (job #599062)
Cod sursa(job #599062)
#include<fstream>
using namespace std;
int n, m, i, j, sf = 0, v [ 10001 ], a[ 16 ][ 16 ];
void sum()
{int i,j,s=0,smax=0;
for (i=1;i<=m;i++)
{s=0;
for (j=1;j<=n;j++)
s+=a[j][i]*v[j];
if (s<0)
s=s* -1;
smax+=s;
}
if(sf<smax)
sf=smax;
}
void back (int k)
{int i;
if (k>n)
sum();
else
{for (i=-1;i<=1;i+=2)
{v[k]=i;
back (k+1);}
}
}
int main ()
{ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j];
back(1);
g<<sf;
g.close();
f.close();
return 0;
}