这是一篇关于利用树链剖分技术解决HDU 3966 - Aragorn's Story的题目，题目要求在给定的树结构中对路径上的节点进行增减操作，并进行查询。树链剖分是一种有效的数据结构优化技术，适用于这类问题。
Aragorn's Story
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2251 Accepted Submission(s): 614
Problem Description
Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who want to invade his kingdom. As Aragorn knows, the enemy has N camps out of his kingdom and M edges connect them. It is guaranteed that for any two camps, there is one and only one path connect them. At first Aragorn know the number of enemies in every camp. But the enemy is cunning , they will increase or decrease the number of soldiers in camps. Every time the enemy change the number of soldiers, they will set two camps C1 and C2. Then, for C1, C2 and all camps on the path from C1 to C2, they will increase or decrease K soldiers to these camps. Now Aragorn wants to know the number of soldiers in some particular camps real-time.
Input
Multiple test cases, process to the end of input.
For each case, The first line contains three integers N, M, P whi
For each case, The first line contains three integers N, M, P whi
最低0.47元/天 解锁文章
2677
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
