You are viewing a single comment's thread. Return to all comments →
For each of the Q queries, print the number of paths in T having cost C in the inclusive range [L, R] on a new line.
^ That is an ambigious sentence. Can you please elaborate?
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 →
For each of the Q queries, print the number of paths in T having cost C in the inclusive range [L, R] on a new line.
^ That is an ambigious sentence. Can you please elaborate?