- Can be applied for various purposes by defining operations on values and actions
- Correctly answer the four AOJ questions.
- Check that it works correctly, then deploy inline if it is not fast enough
- Just one inline deployment in one location to answer the four AOJ questions within the time limit.
- https://github.com/nishio/atcoder/tree/master/memo/segment_tree
This page is auto-translated from /nishio/汎用で実用的な遅延伝搬セグメント木の実装 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.