Pagini recente » Cod sursa (job #2451563) | Cod sursa (job #1846013) | Cod sursa (job #1846497) | Cod sursa (job #3143495) | Cod sursa (job #3304531)
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
cin.tie(nullptr)->sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> v(n + 2, vector<int>(m + 2));
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
cin >> v[i][j];
}
}
fclose(stdin);
int ans = 0;
for(int msk = 0; msk < (1 << m); msk++)
{
int sum = 0;
for(int i = 1; i <= n; i++)
{
int csm = 0;
for(int j = 1; j <= m; j++)
{
csm += v[i][j] * ((msk & (1 << (j - 1))) ? (-1) : (1));
}
sum += (csm < 0) ? (-csm) : (csm);
}
ans = max(ans, sum);
}
cout << ans;
fclose(stdout);
}