Pagini recente » Cod sursa (job #2540666) | Cod sursa (job #386452) | Cod sursa (job #3183971) | Cod sursa (job #1768422) | Cod sursa (job #188326)
Cod sursa(job #188326)
#include<fstream.h>
int o[101],n,m,max;
int v[17][17];
ifstream fin("flip.in");
ofstream fout("flip.out");
void calculeaza();
void back(int k);
void calculeaza(){
int s=0,k,j,x;
for (j=1; j<=m; j++) {
x=0;
for (k=1; k<=n; k++)
x=x+o[k]*v[k][j];
if (x<0)
s=s-x;
else
s=s+x;
}
if (s>max)
max=s;
}
void back(int k){
int i;
if (k==n+1) calculeaza();
else
for (i=-1; i<=1; i=i+2){
o[k]=i;
back(k+1);
}
}
int main() {
int i,j;
fin>>n>>m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++){
fin>>v[i][j];
max=max+v[i][j];
}
back(1);
fout<<max;
fin.close();
fout.close();
return 0;
}