Pagini recente » Cod sursa (job #211416) | Cod sursa (job #1459524) | Cod sursa (job #472933) | Cod sursa (job #358128) | Cod sursa (job #2628828)
#include <fstream>
using namespace std;
int maxx = -25600000;
int a[ 17 ][ 17 ], n, m, semn[ 17 ];
ifstream cin( "flip.in" );
ofstream cout( "flip.out" );
int suma(){
int s = 0, sum, l , c;
for( c = 0; c < m; c++ ){
sum = 0;
for( l = 0; l < n; l++ )
sum += a[ l ][ c ] * semn[ l ];
if( sum < 0 )
sum = -sum;
s += sum;
}
return s;
}
void bkt( int pos ){
int s;
if( pos == n ){
//cout << "caca";
if( maxx < ( s = suma() ) ){
maxx = s;
////cout << s << '\n';
}
return;
}else {
// cout << "caca";
semn[ pos ] = 1;
bkt( pos + 1 );
semn[ pos ] = -1;
bkt( pos + 1 );
}
}
int main()
{
int l, c;
cin >> n >> m;
for( l = 0; l < n; l++ )
for( c = 0; c < m; c++ )
cin >> a[ l ][ c ];
bkt( 0 );
cout << maxx << '\n';
return 0;
}