Pagini recente » Cod sursa (job #1757002) | Cod sursa (job #1103897) | Cod sursa (job #2853872) | Cod sursa (job #1888102) | Cod sursa (job #3141387)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,A[17][17],v[17],Smax=-999999999;
void bk(int k)
{
if(k>m)
{
int t=0;
for(int i=1; i<=n; i++)
{
int s=0;
for(int j=1; j<=m; j++)
{
if(v[j]==1)
{
s=s-A[i][j];
}
else
{
s=s+A[i][j];
}
}
if(s<0)
{
t=t-s;
}
else
{
t=t+s;
}
}
if(t>Smax)
{
Smax=t;
}
}
else
{
v[k]=0;
bk(k+1);
v[k]=1;
bk(k+1);
}
}
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
fin>>A[i][j];
}
}
bk(1);
fout<<Smax;
fin.close();
fout.close();
return 0;
}