Pagini recente » Cod sursa (job #3260429) | Cod sursa (job #979347) | Cod sursa (job #591698) | Cod sursa (job #2230165) | Cod sursa (job #2910521)
#include <bits/stdc++.h>
using namespace std;
bool flipc[20], flipl[20];
int a[20][20], c, l, maxi = INT_MIN;
void backt(int m, int n)
{
if(m==l+1&&n==c+1)
{
int s = 0;
for(int i = 1; i<=l;i++)
for(int j = 1; j<=c; j++)
s+=a[i][j]*(flipc[j]*2-1)*(flipl[i]*2-1);
if(s>maxi)
maxi = s;
}
else if(m!=l+1)
for(int i = 0; i<=1; i++)
{
flipl[m] = i;
backt(m+1,n);
}
else
for(int i = 0; i<=1; i++)
{
flipc[n] = i;
backt(m,n+1);
}
}
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>l>>c;
for(int i = 1; i<=l; i++)
for(int j = 1; j<=c; j++)
f>>a[i][j];
backt(1,1);
g<<maxi;
return 0;
}