Pagini recente » Cod sursa (job #1099172) | Cod sursa (job #3121816) | Cod sursa (job #2240578) | Cod sursa (job #2558323) | Cod sursa (job #3210634)
#include <iostream>
using namespace std;
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
int n, m;
cin>>n>>m;
int v[n+1][m+1];
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
cin>>v[i][j];
int maxim=0;
for(int mask=0; mask<=(1<<m)-1; mask++)
{
int suma=0;
for(int i=1; i<=n; i++)
{
int s=0;
for(int j=1; j<=m; j++)
if(mask&(1<<(j-1)))
s+=v[i][j];
else
s-=v[i][j];
suma+=abs(s);
}
maxim=max(maxim, suma);
}
cout<<maxim;
return 0;
}