摘要: P4103 看到\(\sum k \leq n\)直接想到建虚树\(dp\) \(mi_i = min \lbrace dep_v - dep_i \rbrace\) \(mx_i = max \lbrace dep_v-dep_i\rbrace\) \(sum_i = \sum dep_v-dep 阅读全文
posted @ 2026-01-21 13:43 Jklans 阅读(3) 评论(0) 推荐(0)