Pagini recente » Cod sursa (job #680612) | Cod sursa (job #2577762) | Cod sursa (job #722230) | Cod sursa (job #591994) | Cod sursa (job #572654)
Cod sursa(job #572654)
#include <fstream>
using namespace std;
long a[17][17], v[17];
//long sorok[17], b, c;
int n, m;
//int ossz=0, i, j, k;
long backtrack(int i){
if(i<=n){
long b,c;
v[i]=1;
b=backtrack(i+1);
v[i]=-1;
c=backtrack(i+1);
return max(b,c);
}
else{
long osszeg=0;
for(int j=1; j<=m; j++){
long ro=0;
for(int k=1; k<=n; k++)
ro+=a[k][j]*v[k];
osszeg+=abs(ro);
}
return osszeg;
}
}
int main(){
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(int i=1; i<=n; i++){
//long ossz=0;
for(int j=1; j<=m; j++){
f>>a[i][j];
// ossz+=a[i][j];
}
//sorok[i]=ossz;
}
/*for(i=1; i<=n; i++)
ossz+=sorok[i];
i++;*/
g<<backtrack(1);
}