对如何选择该层的最大宽度作了一个丑丑的图解
#include<cstdio>
#include<cstring>
#include<vector>
#include<iostream>
using namespace std;
struct Tree {
double L, R; // distance from the root to the leftmost/rightmost point
// L,R可为负,为负即有重叠
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)⊂ left; left = (left-1)&subset) {
have_children = true;
//枚举当前集合的子集,有子集则进入循环,无子集则当前集合是吊坠,将其压入vector
int right = subset^left;
//rch是全集与lch的差集
double d1 = sum[right] / sum[subset];
double d2 = sum[left] / sum[subset];
// W1*D2=W2*D1 D1+D2=1
dfs(left); dfs(right);
// 完成对子树的枚举后计算从底层到该层的最大宽度
for(int i = 0; i < tree[left].size(); i++)
for(int j = 0; j < tree[right].size(); j++) {
Tree t;
t.L = max(tree[left][i].L + d1, tree[right][j].L - d2);
// 该结点lch的L端+d1 或 rch的L端-d2
t.R = max(tree[right][j].R + d2, tree[left][i].R - d1);
// 选出t.L和t.R max, 则t.L+t.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);
while(T--) {
scanf("%lf%d", &r, &n);
for(int i = 0; i < n; i++) scanf("%lf", &w[i]);
for(int i = 0; i < (1<<n); i++) {//枚举子集编号i,每种排列方式对应此处的一个子集
sum[i] = 0;
tree[i].clear();
for(int j = 0; j < n; j++) //打印0,1,2,n-1的子集
if(i & (1<<j)) sum[i] += w[j]; //sum是子集的重量之和
}
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;
}