Practice 5 (2024)
· One min read
I checked solution descriptions and solutions in for the problems in practice 5. This practice repeated a number of the techniques we studied for earlier sets.
Related resources.
- Handbook chapters on Dijkstra and Segment Trees
- USACO (Single Source) Shortest Paths with Non-Negative Edge Weights has more pointers to links about Dijkstra
- USACO Segment Tree
