标签 树形DP 下的文章

Codeforces - 1153D - Serval and Rooted Tree

地址https://codeforces.com/contest/1153/problem/D原文地址https://www.lucien.ink/archives/416代码https://pasteme.cn/6251#include <bits/stdc++.h> const int maxn = int(3e5) + 7; std::vector<int> e...