A structure for answering maximum queries on a set of linear functions. Supports two operations: inserting a linear function and querying for maximum at a given point. The queries can be done in any order, and we can do all the calculations using integers. https://cp-algorithms.com/geometry/convex_hull_trick.html#li-chao-tree Compared to the code in the above link, this implementation further impr
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected