Pagini recente » Cod sursa (job #2634641) | Cod sursa (job #1793315) | Cod sursa (job #1221643) | Cod sursa (job #124936) | Cod sursa (job #1535954)
# include <bits/stdc++.h>
using namespace std;
const int Nmax = 17;
int N, M, i, j, a[Nmax][Nmax], sum, sum_c, res;
int main ()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d %d\n", &N, &M);
for (i = 1; i <= N; ++i)
for (j = 1; j <= M; ++j)
scanf("%d", &a[i][j]);
for (int i = 1; i < (1 << M); ++i) {
sum = 0;
for (int I = 1; I <= N; ++I){
sum_c = 0;
for (int J = 0; J < M; ++J){
if (i & (1 << J)) sum_c -= a[I][J + 1];
else sum_c += a[I][J + 1];
}
sum += abs(sum_c);
}
res = max(res, sum);
}
printf("%d\n", res);
return 0;
}