Pagini recente » Cod sursa (job #527159) | Cod sursa (job #2738494) | Cod sursa (job #471357) | Cod sursa (job #1889018) | Cod sursa (job #2327133)
#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;
void bkt(int pas)
{
if(pas == n + m + 1)
{
sum = 0;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
sum += mat[i][j];
maxx = max(maxx, sum);
return;
}
if(pas <= n)
{
for(int j = 1; j <= m; ++j)
mat[pas][j] *= (-1);
bkt(pas + 1);
for(int j = 1; j <= m; ++j)
mat[pas][j] *= (-1);
bkt(pas + 1);
}
else
{
for(int i = 1; i <= n; ++i)
mat[i][pas - n] *= (-1);
bkt(pas + 1);
for(int i = 1; i <= n; ++i)
mat[i][pas - n] *= (-1);
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;
}