Pagini recente » Istoria paginii runda/winners8/clasament | Monitorul de evaluare | Cod sursa (job #1851460) | Cod sursa (job #252038) | Cod sursa (job #754504)
Cod sursa(job #754504)
#include <stdio.h>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int flip[16], flipedMat[16][16];
int mat[16][16];
int n, m;
void nextConfig()
{
for(int i = 0; i < n; i++)
{
if(flip[i] == 0)
{
flip[i] = 1;
break;
}
flip[i] = 0;
}
}
void flipMatrix()
{
for(int i = 0; i< n; i++)
{
if(flip[i] == 1)
for(int j = 0; j<m; j++)
{
flipedMat[i][j] = -mat[i][j];
}
else
{
for(int j = 0; j<m; j++)
{
flipedMat[i][j] = mat[i][j];
}
}
}
}
void flipCol(int j)
{
for(int i = 0; i< n; i++)
flipedMat [i][j] = -flipedMat[i][j];
}
int main()
{
f>>n;
f>>m;
int i,j;
int maxMax = 0;
for(i = 0; i<n; i++)
{
for(j = 0; j<m; j++)
{
f>>mat[i][j];
maxMax += mat[i][j];
}
}
int nrConfig = (1<<n);
for(int k = 0; k < nrConfig; k++)
{
nextConfig();
flipMatrix();
//calculate max for the config
//flip the columns
for(j = 0; j < m; j++)
{
int sumCol = 0;
for(i = 0; i < n; i++)
{
sumCol += flipedMat[i][j];
}
if(sumCol < 0)
{
flipCol(j);
}
}
//calculate the sum
int max = 0;
for(i = 0; i<n; i++)
{
for(j = 0; j<m; j++)
{
max += flipedMat[i][j];
}
}
//restore max
if(max > maxMax)
{
maxMax = max;
}
}
g<<maxMax;
f.close();
g.close();
return 0;
}