摘要："ref" 总的来说，就是 1. 容斥转化为点对应到点集问题。 2. 树形 dp 解决转化后的问题。 cpp include include include include using namespace std; typedef long long ll; int n, m, hea[19], c 阅读全文

摘要：分数规划+树形依赖背包 "orz" 阅读全文

摘要："too hard" cpp include include using namespace std; int n, d, m, uu, vv, hea[500005], cnt, w[500005], f[500005][22], g[500005][22]; bool vis[500005]; 阅读全文

摘要：num[x]表示x到达叶子最远路径。 每个子节点对答案的贡献是num[x] (num[t] + edge[i].val) cpp include include using namespace std; typedef long long ll; int n, ss, hea[500005], cn 阅读全文