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.
with proper use of disjoint sets,maps and sets(binary search,if u don't want to use sets) ,u can solve this problem.
quite similar approach which is used for solving KOICOST of spoj.
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 →
with proper use of disjoint sets,maps and sets(binary search,if u don't want to use sets) ,u can solve this problem. quite similar approach which is used for solving KOICOST of spoj.