Pagini recente » Cod sursa (job #2843062) | Cod sursa (job #1603979) | Cod sursa (job #1996714) | Cod sursa (job #555775) | Cod sursa (job #1336238)
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int v[17][17],sol[20],n,m,i,j,ans=-99999999,sec[20];
void afis()
{
int i,j,sum=0;
for(i=1;i<=n;++i)
{
sec[i]=0;
for(j=1;j<=m;++j) sec[i]+=sol[j]*v[i][j];
if(sec[i]<0) sec[i]=-sec[i];
sum+=sec[i];
}
if(sum>ans) ans=sum;
}
void bkt(int k)
{
if(k==m+1) afis();
else
{
sol[k]=-1;
bkt(k+1);
sol[k]=1;
bkt(k+1);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j) f>>v[i][j];
bkt(1);
g<<ans<<'\n';
return 0;
}