usaco-guide/Plat_Seg.md

Segment Tree

This data structure allows you to do point update and range query in O(\log N) time each for any associative operation.

• Tutorial
  • CPH 9.3
  • CSAcademy Tutorial
  • cp-algorithms
  • Codeforces Tutorial
  • Slides from CPC.3

Practice Problems

• USACO Springboards
  • can use segment tree with min query in place of the map mentioned in analysis
• POI Cards
• Counting Haybales (USACO Plat)
  • Lazy Updates