Pagini recente » Cod sursa (job #2865460) | Cod sursa (job #683802) | Cod sursa (job #1109635) | Cod sursa (job #1087059) | Cod sursa (job #2191928)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int N,M;
int A[20][20];
int X[20];
int MSum;
void Read()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
for(int j=1;j<=M;j++)
fin>>A[i][j];
}
void Solve()
{
int Sum=0;
for(int j=1;j<=M;j++)
{
int s=0;
for(int i=1;i<=N;i++)
s += A[i][j] * X[i];
if (s < 0)
s *= -1;
Sum += s;
}
MSum = max(MSum,Sum);
}
void Back(int l)
{
for(int i=-1;i<=1;i+=2)
{
X[l] = i;
if (l == N)
Solve();
else
Back(l+1);
}
}
int main()
{
Read();
Back(1);
fout<<MSum;
return 0;
}