Need help in a question

Revision en2, by pratheekrai2002, 2023-08-29 00:51:18

Sorry if the question had been asked before, but I needed help in the following problem, any hints or topics from which it is based on would be helpful : given a tree with n nodes with each node containing a value a[i] associated with node i, also you have q queires containing of 2 nodes u and v, and a value t, you need to find the no of nodes in the simple path between u and v that have a value of atmost t? n<=1e5 q<=1e5 1<=u,v<=n t<=1e9

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English pratheekrai2002 2023-08-29 00:51:18 16 Tiny change: 'n the follwong question, any hin' -> 'n the following problem, any hin'
en1 English pratheekrai2002 2023-08-29 00:49:31 470 Initial revision (published)