Pagini recente » Cod sursa (job #1997526) | Cod sursa (job #299693) | Cod sursa (job #416078) | Cod sursa (job #2224745) | Cod sursa (job #1979827)
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("flip.in");
ofstream so("flip.out");
int n,m,v[20][20],sp[20],spx[20];
int main()
{
int n,m;
si>>n>>m;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
si>>v[i][j];
sp[i]+=v[i][j];
}
}
int smax=0,sum;
for(int sb=0;sb<(1<<m);++sb)
{
sum=0;
for(int i=1;i<=n;++i)
spx[i]=sp[i];
for(int j=0;j<m;++j)
{
if(sb&(1<<j))
{
for(int i=1;i<=n;++i)
{
spx[i]=spx[i]-2*v[i][m-j];
}
}
}
for(int i=1;i<=n;++i)
sum+=max(spx[i],-spx[i]);
smax=max(smax,sum);
}
so<<smax<<'\n';
return 0;
}