Pagini recente » Cod sursa (job #2535151) | Cod sursa (job #3194084) | Cod sursa (job #379861) | Cod sursa (job #2001455) | Cod sursa (job #1457211)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],n,m,sol,aux[20][20];
inline void Citire()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
f>>a[i][j];
sol+=a[i][j];
}
}
inline void Check(int ind)
{
for(int i=1;i<=m;i++)
aux[ind][i]*=-1;
}
inline void Conf()
{
int p,ind;
for(int i=0;i<(1<<n);i++)
{
p=i;
ind=1;
for(int k=1;k<=n;k++)
for(int j=1;j<=m;j++)
aux[k][j]=a[k][j];
while(p!=0)
{
if(p%2==1)
Check(ind);
ind++;
p/=2;
}
int solc=0;
for(int j=1;j<=m;j++)
{
int s=0;
for(int k=1;k<=n;k++)
s+=aux[k][j];
if(s<0)
solc-=s;
else
solc+=s;
}
sol=max(sol,solc);
}
g<<sol;
}
int main()
{
Citire();
Conf();
return 0;
}