Pagini recente » Cod sursa (job #1110919) | Cod sursa (job #2395474) | Cod sursa (job #2192254) | Cod sursa (job #1217178) | Cod sursa (job #2376217)
#include <bits/stdc++.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n, m, maxim, x[20][20],s[20];
void check() {
long long s1, st=0;
s1=0;
for(int i=1; i<=m; i++) {
s1=0;
for(int j=1; j<=n; j++)
s1+=s[j]*x[j][i];
if(s1<0) s1=-s1;
st+=s1;
}
if(st>maxim) maxim=st;
}
void exec(int k) {
if(k>n) check();
else {
s[k]=1;
exec(k+1);
s[k]=-1;
exec(k+1);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>x[i][j];
exec(1);
g<<maxim;
f.close();
g.close();
}