Pagini recente » Cod sursa (job #693007) | Cod sursa (job #532958) | Cod sursa (job #2465027) | Cod sursa (job #2359016) | Cod sursa (job #2337300)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int mat[20][20], n,m, sum, maxx = INT_MIN;
int l[20], col[20];
void bkt(int pas)
{
if(pas == n + 1)
{
int bigSum = 0;
for(int j = 1; j <= m; ++j){
sum = 0;
for(int i = 1; i <= n; ++i)
if((l[i] == 1))
sum += (mat[i][j] * -1);
else
sum += mat[i][j];
if(sum < 0)
bigSum += (-sum);
else bigSum += sum;
}
maxx = max(maxx, bigSum);
return;
}
if(pas <= n)
{
l[pas] = 1;
bkt(pas + 1);
l[pas] = 0;
bkt(pas + 1);
}
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
fin >> mat[i][j];
bkt(1);
fout << maxx << '\n';
return 0;
}