The Li-Chao Tree: Algorithm Specification and Analysis (opens in new tab)
arXiv:2603.07948v1 Announce Type: cross Abstract: The Li-Chao tree (LICT) was first introduced in lecture as an efficient data structure for dynamic lower envelope maintenance. In the years since, it has achieved widespread adoption within the competitive programming community, yet no formal specification has appeared in the peer-reviewed literature. This paper provides the definitive formalization of the Li-Chao tree, serving as both the official specification and an expansion of the origin...
Read the original article