Data Structures
Max Suffix Query with Insertions OnlyWavelet TreeCounting Minimums with Segment TreeSegment Tree BeatsPersistent Data StructuresTreaps
Convexity
LineContainerLagrangian RelaxationSlope Trick
Graphs
Shortest Paths with Negative Edge WeightsEulerian ToursBCCs and 2CCsStrongly Connected ComponentsOffline DeletionEuler's FormulaCriticalLink Cut Tree
Dynamic Programming
DP on Trees - Combining SubtreesAdditional DP Optimizations and TechniquesSum over Subsets DP
Flows
Maximum FlowMinimum CutFlow with Lower BoundsMinimum Cost Flow
Polynomials
Introduction to Fast Fourier TransformMore Complex Operations Using FFT
Strings
String SearchingSuffix ArrayString Suffix Structures
Misc. Topics
Extended Euclidean AlgorithmXOR BasisFracturing SearchGame TheoryPrefix Sums of Multiplicative FunctionsMatroid IntersectionInteractive and Communication ProblemsVectorization in C++

Table of Contents

Edit on Github

JOI 2015 - Navigation

Authors: Andi Qu, Benjamin Qi

Table of Contents


Edit on Github

We essentially want to root the tree at T and always move to the parent of the current node until we end up at T.

Hint 1

Hint 2

Hint 3

Solution

Give Us Feedback on JOI 2015 - Navigation!

Join the Discussion!

Feel free to voice your thoughts in the comments section.

Need help? Join the USACO Forum!