Pagini recente » Cod sursa (job #1082327) | Cod sursa (job #2978187) | Cod sursa (job #2689322) | Cod sursa (job #465367) | Cod sursa (job #986246)
Cod sursa(job #986246)
#include <fstream>
using namespace std;
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, a[16][16];
fin >> n >> m;
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
fin >> a[i][j];
fin.close();
int smax = -2147483648;
for (int k=0; k<(1<<m); k++)
{
int s = 0;
for (int i=0; i<n; i++){
int row_sum = 0;
for (int j=0; j<m; j++)
if (k & (1<<j))
row_sum += -a[i][j];
else
row_sum += a[i][j];
if (row_sum < -row_sum) row_sum = -row_sum;
s += row_sum;
}
if (smax < s) smax = s;
}
fout << smax;
fout.close();
return 0;
}