[算法竞赛入门经典] 天平难题 UVa1354 详细注解 P310

//https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa1354.cpp
// UVa1354 Mobile Computing
// Rujia Liu
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;

struct Tree {
  double L, R; // distance from the root to the leftmost/rightmost point
  Tree():L(0),R(0) {}
};

const int maxn = 6;

int n, vis[1<<maxn];
double r, w[maxn], sum[1<<maxn];
vector<Tree> tree[1<<maxn];

void dfs(int subset) {
  if(vis[subset]) return;
  vis[subset] = true;

  bool have_children = false;
  for(int left = (subset-1)&subset; left; left = (left-1)&subset) {
    have_children = true;

    int right = subset^left;
    //左边的距离，杆子的总长为1，所以省略了“*总长（1）”
    double d1 = sum[right] / sum[subset];
    //右边的距离
    double d2 = sum[left] / sum[subset];

    dfs(left); dfs(right);

    for(int i = 0; i < tree[left].size(); i++)
      for(int j = 0; j < tree[right].size(); j++) {
        Tree t;
        //不同的子天平可以相互重叠 见书图7-11 P312
        t.L = max(tree[left][i].L + d1, tree[right][j].L - d2);
        t.R = max(tree[right][j].R + d2, tree[left][i].R - d1);
        // 应该是t.L + t.R > r
        if(t.L + t.R < r) tree[subset].push_back(t);
      }
  }

  if(!have_children) tree[subset].push_back(Tree());
}

int main() {
  int T;
  scanf("%d", &T);
  // T组输入
  while(T--) {
    //房间宽度 r 吊坠数目n
    scanf("%lf%d", &r, &n);
    //第i个吊坠重量w[i]
    for(int i = 0; i < n; i++) scanf("%lf", &w[i]);
    /*
            (1<<n)-1 ==> 1111...11(共n位的1)
            sum[i] 表示i对应的二进制数（每个置位的位都代表着一个吊坠）的重量，
        方便后面计算的时候查表。
            比如n为4，左边挂吊坠的表示为1101， 右边为0010，即左边挂了第0，2，
        3个吊坠，右边挂了第1个吊坠。
    */
    for(int i = 0; i < (1<<n); i++) {
      sum[i] = 0;
      tree[i].clear();
      for(int j = 0; j < n; j++)
        if(i & (1<<j)) sum[i] += w[j];
    }

    int root = (1<<n)-1;
    memset(vis, 0, sizeof(vis));
    dfs(root);

    double ans = -1;
    for(int i = 0; i < tree[root].size(); i++)
      ans = max(ans, tree[root][i].L + tree[root][i].R);
    printf("%.10lf\n", ans);
  }
  return 0;
}