Pagini recente » Cod sursa (job #171412) | Cod sursa (job #2273992) | Cod sursa (job #2072858) | Cod sursa (job #2039643) | Cod sursa (job #494092)
Cod sursa(job #494092)
#include <fstream>
using namespace std;
int main()
{long i, j, p=1, sum, s, smax=0, ma[20][20], v[20];
int k, l, n, m, y[20];
ifstream fin("flip.in");
ofstream fout("flip.out");
fin>>n>>m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
fin>>ma[i][j];
p=(p<<n)-1;
for (i=1; i<=p; i++)
{for (j=1; j<=n; j++)
y[j]=i>>(j-1)& 1;
for (k=1; k<=m; k++)
{sum=0;
for (l=1; l<=n; l++)
if (y[l]==1) sum-=ma[l][k];
else sum+=ma[l][k];
if (sum<0) v[k]=-sum;
else v[k]=sum;
}
s=0;
for (k=1; k<=m; k++)
s=s+v[k];
if (s>smax) smax=s;
}
fout<<smax;
fin.close();
fout.close();
return 0;
}