这是一个关于树链剖分的题目，涉及对树形结构的操作。给定一棵有N个节点的树，每个边有初始成本，可以进行两种操作：改变边的成本或查询从节点a到节点b路径上的最大边成本。题目包含不超过20个测试用例，每个用例有N-1条边信息和一系列操作指令，最后以'DONE'结束。对于每个查询操作，需要返回路径上边的最大权值。
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.
We will ask you to perfrom some instructions of the following form:
- CHANGE i ti : change the cost of the i-th edge to ti
or - QUERY a b : ask for the maximum edge cost on the path from node a to node b
Input
The first line of input contains an integer t, the number of test cases (t <= 20). t test cases follow.
For each test case:
- In the first line there is an integer N (N <&#
最低0.47元/天 解锁文章
扫一扫
1189
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
