Pagini recente » Cod sursa (job #651791) | Cod sursa (job #1404974) | Cod sursa (job #1762565) | Valorificarea spiritului competititv | Cod sursa (job #798841)
Cod sursa(job #798841)
#include<fstream>
using namespace std;
int a[17][17],i,j,n,m;
long long mx;
void swap_row(int x)
{
int i;
for (i=1;i<=m;i++)
a[x][i]*=-1;
}
void swap_col(int x)
{
int i;
for (i=1;i<=n;i++)
a[i][x]*=-1;
}
long long sum()
{
int i,j;
long long s=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
s+=a[i][j];
return s;
}
void back(int k)
{
if (k==n+m)
{
long long p=sum();
if (p>mx)
mx=p;
}
else
{
back(k+1);
if (k<=n)
swap_row(k);
else swap_col(k-n);
back(k+1);
if (k>=n)
swap_row(k);
else swap_col(k-n);
}
}
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f >> n >> m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f >> a[i][j];
back(1);
g << mx;
return 0;
}