Pagini recente » Rezultatele filtrării | Cod sursa (job #1105831)
#include <fstream>
using namespace std;
ifstream cin("flip.in");
ofstream cout("flip.out");
int n, m, x, a[20][20], v[50], b;
void calcul(int k)
{
int i, j, l = 0;;
for (j = 1; j <= m; j++)
{
int s = 0;
for (i = 1; i <= n; i++)
s = s + v[i] * a[i][j];
if (s<0)s = -s;
l = l + s;
}
if (l > x)x = l;
}
void BK(int k)
{
for (int i = -1; i <= 1; i = i + 2)
{
v[k] = i;
if (k == n)calcul(k);
else BK(k + 1);
}
}
int main()
{
int i, j;
cin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
cin >> a[i][j];
BK(1);
cout << x;
return 0;
}