Pagini recente » Cod sursa (job #3038211) | Cod sursa (job #1136762) | Cod sursa (job #1386723) | Cod sursa (job #912763) | Cod sursa (job #2239656)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int tab[20][20], i, j, nrl, nrc, sc[20], v[20], sum, Max;
int mod(int x)
{
if(x < 0)
return -x;
return x;
}
void backt(int x)
{
if(x <= nrl)
{
backt(x+1);
sum = 0;
for(i = 1; i <= nrc; i++)
{
sc[i] = sc[i] - 2*tab[x][i];
sum += mod(sc[i]);
}
if(sum > Max)
{
Max = sum;
}
backt(x+1);
for(i = 1; i <= nrc; i++)
{
sc[i] = sc[i] + 2*tab[x][i];
}
}
}
int main()
{
fin >> nrl >> nrc;
for(i = 1; i <= nrl; i++)
{
for(j = 1; j <= nrc; j++)
{
fin >> tab[i][j];
sc[j] += tab[i][j];
}
}
for(i = 1; i <= nrc; i++)
Max += sc[i];
backt(1);
fout << Max;
return 0;
}