Pagini recente » Cod sursa (job #2102820) | Cod sursa (job #1087637) | Cod sursa (job #1528838) | Cod sursa (job #3037629) | Cod sursa (job #331048)
Cod sursa(job #331048)
#include <stdlib.h>
#include <stdio.h>
int a [20][20], st [20];
int m, n;
long suma = 0;
void max () {
int i, j;
long s = 0, s1 = 0;
for (i=1; i<=m; ++i) {
for (j=1; j<=n; ++j)
s1 += a [i][j] * st [j];
if (s1 < 0) s += -s1;
else s += s1;
s1 = 0;
}
if (suma < s) suma = s;
}
void back (int k) {
int i;
for (i=-1; i<=1; i=i+2) {
st [k] = i;
if (k == n) max ();
else back (k+1);
}
}
int main () {
FILE *f = fopen ("flip.in", "r");
fscanf (f, "%d %d", &m, &n);
int i, j;
for (i=1; i<=m; ++i)
for (j=1; j<=n; ++j)
fscanf (f, "%d", &a [i][j]);
fclose (f);
back (1);
f = fopen ("flip.out", "w");
fprintf (f, "%ld", suma);
fclose (f);
return 0;
}