We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://oi-wiki.org/graph/lca/#tarjan
根据参考文献,需要修改并查集的实现,才能得到$O(1)$的复杂度。并不是只要写带路径压缩的并查集就可以自动得到$O(1)$的复杂度。
The text was updated successfully, but these errors were encountered:
感谢你对 OI Wiki 的关注!记得在 Issue 中表达清楚自己的意思哦~
Sorry, something went wrong.
本人找到一个这个 https://ljt12138.blog.uoj.ac/blog/4874 ,不知道有没有帮助。
RMQ标准算法和线性树上并查集 - 博客 - ljt12138的博客
作为#1567 的延续
@Great-designer 求 lca 算法不是 tarjan 最早提出的。
现在才看到这个,在 #4431 大概已经解决了,应该可以 close 了
No branches or pull requests
请选择:
我正在访问这个页面
https://oi-wiki.org/graph/lca/#tarjan
我发现页面有这样的问题
根据参考文献,需要修改并查集的实现,才能得到$O(1)$的复杂度。并不是只要写带路径压缩的并查集就可以自动得到$O(1)$的复杂度。
The text was updated successfully, but these errors were encountered: