题解 | # 2026年4月28日日记 #
无向图最小字典序欧拉路径:https://www.matiji.net/exam/brushquestion/4/4634/7948FA869678083D1D01ACAA1ABCFB0B?from=noi
树形dp求树的直径模板(两次dfs/bfs无法处理边权为非负的情况):https://www.matiji.net/exam/brushquestion/1/4635/7948FA869678083D1D01ACAA1ABCFB0B?from=noi
LCA + (思维)树上前缀和(书上修改模板):https://www.matiji.net/exam/brushquestion/3/4635/7948FA869678083D1D01ACAA1ABCFB0B?from=noi
DFS序 (欧拉序)将树上不容易执行的操作问题转化为数组的线段树操作(详细分析):https://www.matiji.net/exam/brushquestion/4/4635/7948FA869678083D1D01ACAA1ABCFB0B?from=noi

查看16道真题和解析