随笔分类 -  线段树合并

2024 ICPC Asia Pacific Championship-K-线段树合并or主席树
摘要：比赛链接：https://codeforces.com/contest/1938 给一棵有根树，执行以下代码： let L be an empty array for x = 1 to n for y = 1 to n append ((x - 1) * n * n + (LCA(x, y) - 1 阅读全文
posted @ 2024-03-04 16:11 yoshinow2001 阅读(125) 评论(0) 推荐(0)