【2021牛客暑期多校训练营】7-F xay loves trees(dfs序,主席树+标记永久化)
链接:https://ac.nowcoder.com/acm/contest/11258/F来源:牛客网题目描述:You have two trees rooted at 1 that both have n nodes. You need to find the largest subset of {1,2,⋯,n} such that:On the first tree, the set is connected, and for any two points u, v in set, o
原创
2021-08-12 17:18:40 ·
290 阅读 ·
0 评论