Codeforces.1110F.Nearest Leaf(线段树)
给定一棵$n$个点的树。$q$次询问，每次询问给定$v,l,r$，求离$v$最近且DFS序在$[l,r]$之间的叶节点是哪个。
$n,q\leq5\times10^5$。
------------------------------------------------------------------------------------------------------------------------
很久以前的奇怪但现在依旧成立的签名
attack is our red sun $$\color{red}{\boxed{\color{red}{attack\ is\ our\ red\ sun}}}$$ ------------------------------------------------------------------------------------------------------------------------
很久以前的奇怪但现在依旧成立的签名
attack is our red sun $$\color{red}{\boxed{\color{red}{attack\ is\ our\ red\ sun}}}$$ ------------------------------------------------------------------------------------------------------------------------
