Pagini recente » Cod sursa (job #1055781) | Cod sursa (job #3269619) | Cod sursa (job #800295) | Cod sursa (job #3257855) | Cod sursa (job #1611001)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int a[35];
int ma[17][17];
int n,m;
int d;
int mx;
void calc() {
int sum = 0;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
sum += ma[i][j]*a[n-i+1]*a[n+j];
mx = max(sum, mx);
}
void Back(int top) {
if (top == d + 1) {
calc();
return;
}
a[top] = 1;
Back(top+1);
a[top] = -1;
Back(top+1);
}
int main() {
in >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
in >> ma[i][j];
d = m+n;
Back(1);
out << mx;
return 0 ;
}