Pagini recente » Cod sursa (job #1686609) | Cod sursa (job #47782) | Cod sursa (job #2519760) | Cod sursa (job #336298) | Cod sursa (job #2810810)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int v[20][20];
int r[20];
int main()
{
int n,m;
fin >>n>>m;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=m; j++)
{
fin >>v[i][j];
v[i][0]+=v[i][j];
v[0][j]+=v[i][j];
}
}
int k1=1<<m;
long long maxx=0;
for (int x=0; x<=k1; x++)
{
long long sum=0;
for (int i=1;i<=n;i++)
{
long long s=0;
for (int j=1;j<=m;j++)
{
if ((x>>(j-1))&1==1) s-=v[i][j];
else s+=v[i][j];
}
if (s<-s) sum=sum-s;
else sum=sum+s;
}
if (sum>maxx) maxx=sum;
}
fout << maxx;
}