Pagini recente » Borderou de evaluare (job #2178775) | Cod sursa (job #537380) | Cod sursa (job #1740297) | Cod sursa (job #687149) | Cod sursa (job #2221465)
# pragma GCC optimize("O3")
# include <bits/stdc++.h>
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
# define int ll
using namespace std;
int ans,n,m,a[17][17];
int32_t main(){_
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
cin >> n >> m;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < m;j++)
{
cin >> a[i][j];
}
}
for(int mask = 0;mask < (1LL << n);mask++)
{
int summ = 0;
for(int j = 0;j < m;j++)
{
int suma = 0;
for(int i = 0;i < n;i++)
{
int x = a[i][j];
if(mask & (1LL << i)) x = -x;
suma += x;
}
summ += abs(suma);
}
ans = max(ans,summ);
}
rc(ans);
}