Pagini recente » Cod sursa (job #2143346) | Cod sursa (job #2685596) | Cod sursa (job #1049232) | Cod sursa (job #1288071) | Cod sursa (job #2685055)
#include <fstream>
using namespace std;
const int NMAX = 16;
int a[NMAX + 1][NMAX + 1], flip[NMAX + 1], n, m, maxy = -1000000000;
int Flip() {
int s = 0, sum;
for ( int j = 1; j <= m; j++ ) {
sum = 0;
for ( int i = 1; i <= n; i++ )
if ( flip[i] != 0 )
sum -= a[i][j];
else
sum += a[i][j];
s += max ( sum, -sum );
}
return s;
}
ifstream fin ( "flip.in" );
ofstream fout ( "flip.out" );
int main (){
fin >> n >> m;
for ( int i = 1; i <= n; i++ )
for ( int j = 1; j <= m; j++ )
fin >> a[i][j];
for ( int i = 1; i< ( 1 << n ); i++ ) {
for ( int j = 0; ( 1 <<j ) <= i; j++ )
if ( ( ( 1 << j ) & i ) != 0 )
flip[j + 1] = 1;
else
flip[j + 1] = 0;
maxy = max ( maxy, Flip() );
}
fout << maxy;
return 0;
}