HDU 3804 Query on a tree (树链剖分+离线处理)

最新推荐文章于 2019-08-20 16:21:06 发布

Just_JK

最新推荐文章于 2019-08-20 16:21:06 发布

阅读量278

点赞数 1

分类专栏：线段树树链剖分文章标签： hdu acm模板 acm专项训练 ACM 算法

本文链接：https://blog.youkuaiyun.com/qq_37025443/article/details/79434896

版权

Query on a tree

Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1303 Accepted Submission(s): 334

Problem Description

There are some queries on a tree which has n nodes. Every query is described as two integers (X, Y).For each query, you should find the maximum weight of the edges in set E, which satisfies the following two conditions.
1) The edge must on the path from node X to node 1.
2) The edge’s weight should be lower or equal to Y.
Now give you the tree and queries. Can you find out the answer for each query?

Input

The first line of the input is an integer T, indicating the number of test cases. For each case, the first line conta