Pagini recente » Cod sursa (job #2955590) | Cod sursa (job #1215704) | Cod sursa (job #1664996) | Cod sursa (job #2614635) | Cod sursa (job #2038704)
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int a[17][17],v[17],n,m,Max=0,i,j;
void bkt(int k)
{
int i=0 ,j=0;
if(k==n+1)
{
int s=0, c=0;
for(j=1;j<=m;j++)
{
c=0;
for(i=1;i<=n;i++)
{
if(v[i]==1)
c=c-a[i][j];
else c=c+a[i][j];
}
if(c<0)
c=(-1)*c;
s=s+c;
}
if(s>Max)
Max=s;
return;
}
for(i=0;i<=1;i++)
{
v[k]=i;
bkt(k+1);
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
in>>a[i][j];
bkt(1);
out<<Max;
return 0;}