Pagini recente » Atasamentele paginii Clasament qwegqe | Cod sursa (job #2428638) | Cod sursa (job #2316531) | Cod sursa (job #2392933) | Cod sursa (job #2055671)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],m,n,sol=-1000000000,s[20];
int gsol() {
int sum,ret = 0;
for (int i=1;i<=n;i++) {
sum = 0;
for (int j=1;j<=m;j++) {
sum+=s[j]*a[i][j];
}
ret+=max(sum, -sum);
}
return ret;
}
void bkt(int c) {
if (c == m+1) {
sol = max(sol, gsol());
return;
}
s[c] = 1; bkt(c+1);
s[c] = 1; bkt(c+1);
}
int main()
{
f>>n>>m;
for (int i=1; i<=m; i++) {
for (int j = 1; j <= m; j++) {
f>>a[i][j];
}
}
s[1] = 1;
bkt(2);
g<<sol;
return 0;
}