Pagini recente » Cod sursa (job #3145281) | Istoria paginii runda/orange_morning | Cod sursa (job #398954) | Istoria paginii runda/tema_lee | Cod sursa (job #1394739)
import java.io.*;
import java.util.*;
class Main {
static long max = Long.MIN_VALUE;
static int n,m;
static long[][] a;
static long[] semn;
public static void bkt(int k) {
if (k == n) {
long sum = 0;
for (int i = 0; i < n; i++) {
long sumLinie = 0;
for (int j = 0; j < m; j++) {
sumLinie += a[i][j]*semn[j];
}
sum += Math.abs(sumLinie);
}
max=Math.max(max,sum);
} else {
semn[k]=1;
bkt(k+1);
semn[k]=-1;
bkt(k+1);
}
}
public static void main(String[] args) throws IOException {
Scanner is = new Scanner(new FileInputStream("flip.in"));
PrintWriter os = new PrintWriter("flip.out", "UTF-8");
n = is.nextInt();
m = is.nextInt();
a = new long[n][m];
semn = new long[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i][j] = is.nextInt();
}
}
bkt(0);
os.println(max);
os.close();
}
}