Path Queries II

CSESTree AlgorithmsOpen on judge ↗

You are given a tree consisting of n nodes. The nodes are numbered 1,2,\ldots,n. Each node has a value. Your task is to process following types of queries: - change the value of node s to x - find the maximum value on the path between nodes a and b. Input The first input line contains two integers n and q: the number of nodes and queries. The nodes are numbered 1,2,\ldots,n. The next line ha

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI