Pagini recente » Cod sursa (job #2137095) | Cod sursa (job #2086772) | Cod sursa (job #476485) | Cod sursa (job #529544) | Cod sursa (job #2006530)
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
long long v[20][20],S;
int n,m;
bool valid(int k)
{
int s1=0,s2=0;
for (int i = 1; i<=n; i++)
{
s1+=v[i][k];
s2+=(v[i][k]*(-1));
}
return (s1<=s2);
}
bool valid2(int k)
{
int s1=0,s2=0;
for (int i = 1; i<=m; i++)
{
s1+=v[k][i];
s2+=(v[k][i]*(-1));
}
return (s1<=s2);
}
int sum()
{
long long s=0;
for(int i = 1; i<=n; i++)
for(int j = 1; j<=m; j++)
s+=v[i][j];
return s;
}
void Back(int k)
{
if (k<=n || k<=m)
{
for(int i = k; i<=m; i++)
{
if (valid(i))
{
for(int j = 1; j<=n; j++)
v[j][k]*=(-1);
if (sum()>=S)
S = sum();
Back(k+1);
}
}
for(int j=1; j<=n; j++)
{
if (valid2(j))
{
for(int i=1; i<=m; i++)
v[k][i]*=(-1);
if (sum()>=S)
S = sum();
Back(k+1);
}
}
}
}
int main()
{
in >> n >> m;
for (int i =1; i<=n; i++)
for (int j=1; j<=m; j++)
{
in >> v[i][j];
S+=v[i][j];
}
Back(1);
out << S;
}