Pagini recente » Cod sursa (job #2984464) | Cod sursa (job #2266638) | Cod sursa (job #1798539) | Cod sursa (job #167331) | Cod sursa (job #2222065)
#include <iostream>
#include <stdio.h>
using namespace std;
int M,N,A[18][18],smax=0,v[33];
int suma ()
{ int i,j;
int s=0;
for (i=1;i<=N;i++)
for (j=1;j<=M;j++)s+=A[i][j]*v[i]*v[j+N];
return s;
}
void backt(int k)
{ int i;
for (i=-1;i<=1;i=i+2)
{ v[k]=i;
if(k==M+N){ int s=suma(); if(s>smax)smax=s; }
else bactk(k+1);
}
}
int main()
{ FILE *f=fopen("flip.in","rt");
FILE *g=fopen("flip.out","wt");
int j;
int i;
fscanf(f,"%d %d",&N,&M);
for (i=1;i<=N;i++)
for (j=1;j<=M;j++)
{fscanf(f,"%d",&A[i][j]); smax+=A[i][j];}
backt(1);
fprintf(g,"%d\n",smax);
fclose(f);
fclose(g);
return 0;
}