Pagini recente » Cod sursa (job #2097150) | Cod sursa (job #2255511) | Cod sursa (job #62636) | Cod sursa (job #363795) | Cod sursa (job #847601)
Cod sursa(job #847601)
#include<fstream>
using namespace std;
int n,m,maxim,x[17][17],v[17],j,s1,s2;
ofstream g("flip.out"); //flip
void verif()
{int i;
s2=0;
for(i=1;i<=n;i++)
{
s1=0;
for(j=1;j<=m;j++)
{
s1+=x[i][j]*v[j];
}
if(s1<0) s2+=s1*-1;
else
s2+=s1;
}
if(s2>maxim)
{
maxim=s2;
}
}
void back(int k)
{int i;
if(k>m)
{
verif();
}
else
{
for(i=-1;i<=1;i+=2)
{
v[k] = i;
back(k+1);
}
}
}
int main()
{int i;
ifstream f("flip.in"); //flip
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>x[i][j];
back(1);
g<<maxim;
return 0;
}