Pagini recente » Cod sursa (job #2806801) | Cod sursa (job #341403) | Cod sursa (job #2771501) | Cod sursa (job #1022102) | Cod sursa (job #2202311)
#include <fstream>
#include <cstdlib>
using namespace std;
int a[20][20], s[20], maxi, n, m;
int maxim(int a, int b) {
if (a > b)
return a;
return b;
}
void calcul()
{
int Su = 0;
for (int j = 1; j <= m; j++)
{
int sumc = 0;
for (int i = 1; i <= n; i++)
sumc += a[i][j] * s[i];
sumc = abs(sumc);
Su += sumc;
maxi = maxim(maxi, Su);
}
}
void Back(int poz)
{
if (poz == n + 1) calcul();
else
{
s[poz] = 1;
Back(poz + 1);
s[poz] = -1;
Back(poz + 1);
}
}
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
f >> a[i][j];
Back(1);
g << maxi;
return 0;
}