shelbytom.23's blog

By shelbytom.23, history, 5 months ago, In English

Given a weighted tree , solve q queries , each query is of form "u v" , return maximum edge weight lying on path from node u to node v. 1<=n<1e5 , 1<=q<=1e5

Full text and comments »

  • Vote: I like it
  • +10
  • Vote: I do not like it