How do you usually implement HLD with segment tree?
Difference between en2 and en3, changed 0 character(s)
Heavy-Light Decomposition with segment tree.↵
↵
Do you flatten the tree by DFS (prioritizing the heavy child) and use a single segment tree over the whole array, [likes:1]↵
↵
or build a separate segment tree for each chain? [likes:2]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English WRKWRK 2025-10-07 06:53:36 0 (published)
en2 English WRKWRK 2025-10-07 06:25:35 66 Tiny change: 'Do you fla' -> 'Heavy-Light Decomposition with segment tree.\n\nDo you fla'
en1 English WRKWRK 2025-10-07 06:24:36 218 Initial revision (saved to drafts)