Pagini recente » Cod sursa (job #1070236) | Cod sursa (job #279317) | Cod sursa (job #1884411) | Cod sursa (job #1215487) | Cod sursa (job #281514)
Cod sursa(job #281514)
#include<fstream.h>
#define DMAX 17
int n,m, k, a[DMAX][DMAX],b[DMAX][DMAX],x[DMAX],SMax;
ifstream f("flip.in"); ofstream g("flip.out");
void prelsol()
{int i,j,s=0,scol;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++) b[j][i]=a[j][i]*x[j];
for(j=1;j<=m;j++)
{scol=0;
for(i=1; i<=n; i++) scol+=b[i][j];
s+=scol>0 ? scol : -scol;
}
if(s>SMax) SMax=s;
}
void back()
{k=1; x[k]=-3;
do
{while (x[k]<0)
{x[k]=2+x[k];
if(k==n) prelsol();
else x[++k]=-3;
}
k--;
} while(k>0);
}
int main()
{f>>n>>m;
for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) f>>a[i][j];
back();
g<<SMax<<'\n';
g.close(); f.close(); return 0;
}