Hi,

On Library Checker's "Segment Add Get Min", my offline Li Chao Tree implementation runs about 2x faster than the second fastest submission (as of 15/02/2026).

Key optimizations

• Radix sort for discretization
• Bottom-up, segment-tree-based structure
• Reduced unnecessary computations

Results

Library Checker 64 ms vs 128 ms → 2x faster

QOJ 57 ms vs 157 ms → ~2.75x faster

Benchmarks were measured on the latest official test data under -std=c++23 -O2.

I won’t go into details here, but the full code is available in the repository. (There are also other very fast implementations in the repo.)

If anyone has comparable benchmarks or alternative optimizations, I’d be happy to discuss.

Thanks.