21 Days Training // Day 16 Posted on 2025年8月10日 By c2022zyh 21 Days Training // Day 16无评论 T0. news My incomplete idea : enum. For every start point, consider it as the root of the tree. Then, for its all subtrees, pass the message to the largest one first, the second largest one … Find all start points with the least time. Pages: 1 2 3 4 5 6 7 8 训练日志