2019年3月7日
Codeforces1110F Nearest Leaf dfs + 线段树 + 询问离线
摘要： Codeforces1110F dfs + 线段树 + 询问离线 F. Nearest Leaf Description: Let's define the Eulerian traversal of a tree (a connected undirected graph without cycl 阅读全文
posted @ 2019-03-07 22:24 图斯卡蓝瑟 阅读(312) 评论(0) 推荐(0)