Codeforces
CF Step
Youtube Linkedin Discord Toggle Dark/Light/Auto mode Toggle Dark/Light/Auto mode Toggle Dark/Light/Auto mode Back to homepage
  1. Home
  2. /
  3. Codeforces
  4. /
  5. Contests
  6. /
  7. Codeforces Round 615 (Div. 3)
  8. /
  9. F. Three Paths on a Tree
  10. /
  11. ToDo : Three Paths on a Tree

ToDo : Three Paths on a Tree

  • Solve CSES : Tree Distances 1
  • Think about DP approach.
  • Think about ways to find diameter with only DFS.
  • Think about ways to solve this with 4 DFS (and no BFS or multi source BFS) as mentioned in this comment
  • Prove why diameter is optimal.