Pagini recente » Cod sursa (job #1981759) | Cod sursa (job #2788016) | Cod sursa (job #2465860) | Cod sursa (job #2657852) | Cod sursa (job #3211386)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, a[20];
int b[20][20];
int main()
{
int i, j, s, stot, smax = INT_MIN;
fin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
fin >> b[i][j];
while (a[0] == 0)
{
stot = 0;
for (i = 1; i <= n; i++)
{
s = 0;
for (j = 1; j <= m; j++)
if (a[j] == 0) s += b[i][j];
else s -= b[i][j];
stot += abs(s);
}
smax = max(smax, stot);
/// gen next sir binar
for (i = m; a[i] == 1; i--)
a[i] = 0;
a[i] = 1;
}
fout << smax << "\n";
return 0;
}