Pagini recente » Cod sursa (job #1297492) | Cod sursa (job #866628) | Cod sursa (job #1904562) | Cod sursa (job #1657927) | Cod sursa (job #2449890)
#include<bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
#define nmax 25
int n,m,a[nmax][nmax],s,s1;
int sum () {
s1=0;
for(int i=1;i<=n;i++) {
int x=0;
for(int j=1;j<=m;j++)
x += a[i][j];
if (x < 0)
x = -x;
s1 += x;
}
}
void bt (int k) {
if (k > m) {
sum();
s=max(s,s1);
}
else {
bt(k+1);
for(int i=1;i<=n;i++)
a[i][k] = -a[i][k];
bt(k+1);
}
}
int main() {
in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
in>>a[i][j];
bt(1);
out<<s;
}