[SPOJ QTREE] Query on a tree【树链剖分】
Problem: You are given a tree (an acyclic undirected co […]
2023 No copyright
新博客地址: darkleafin.cf
(该域名已过期且被抢注。。)
darkleafin.github.io
常年不在线的QQ:
49750
不定期更新的GitHub:
https://github.com/Darkleafin
OPEN AT 2017.12.10
如遇到代码不能正常显示的情况,请刷新页面。
Please refresh the page if the code cannot be displayed normally.
发现一个优美的网站:
https://visualgo.net/en
- Theme by Qzhai
Problem: You are given a tree (an acyclic undirected co […]
Problem: Time Limit: 10 Sec Memory Limit: 162 MB Descr […]
树链剖分,一般特指轻重链剖分 (Heavy-light decomposition),是一种将树划分为链集的启 […]
新博客地址: darkleafin.cf
(该域名已过期且被抢注。。)
darkleafin.github.io
常年不在线的QQ:
49750
不定期更新的GitHub:
https://github.com/Darkleafin
OPEN AT 2017.12.10
如遇到代码不能正常显示的情况,请刷新页面。
Please refresh the page if the code cannot be displayed normally.
发现一个优美的网站:
https://visualgo.net/en
- Theme by Qzhai