We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Interesting problem, took longer than I first thought!
One minor note on the editorial solution:
It correctly notes that for a forest, the total number of paths is a sum over trees, paths. However the increase in paths due to merging trees and can be computed more simply as .
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Super Maximum Cost Queries
You are viewing a single comment's thread. Return to all comments →
Interesting problem, took longer than I first thought!
One minor note on the editorial solution: It correctly notes that for a forest, the total number of paths is a sum over trees, paths. However the increase in paths due to merging trees and can be computed more simply as .