03 2021 档案

虚树
摘要：https://blog.csdn.net/weixin_37517391/article/details/82744605 void insert(int u){ if(top <= 1) {stk[++top] = u;return ;} int lca = LCA(u,stk[top]); i 阅读全文
posted @ 2021-03-08 13:24 ywwywwyww 阅读(58) 评论(0) 推荐(0)