https://blog.youkuaiyun.com/peter_codezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/peter_code/article/details/161503151https://blog.youkuaiyun.com/peter_code/article/details/161503151peter_codeSat, 30 May 2026 19:07:58 +0800https://blog.youkuaiyun.com/peter_code/article/details/160948800https://blog.youkuaiyun.com/peter_code/article/details/160948800peter_codeSun, 10 May 2026 12:01:04 +0800https://blog.youkuaiyun.com/peter_code/article/details/150954791https://blog.youkuaiyun.com/peter_code/article/details/150954791peter_codeFri, 29 Aug 2025 11:19:44 +0800https://blog.youkuaiyun.com/peter_code/article/details/150937189https://blog.youkuaiyun.com/peter_code/article/details/150937189peter_codeThu, 28 Aug 2025 11:09:30 +08001,1->2)。那么，现在我们只需寻找一种高效的方式，每次精准查找需要修改的。所有元素都遍历到，确保大小关系的正确性，防止有数值未更新。现在给你这颗树的初始权值，和修改每个点的代价。，对于每个询问，回答使树的近似中位数为。，显然不能遍历，否则直接给你炸成。这个时候，我们想到，可以开一个。]]>https://blog.youkuaiyun.com/peter_code/article/details/150650560https://blog.youkuaiyun.com/peter_code/article/details/150650560peter_codeSat, 23 Aug 2025 20:30:05 +0800https://blog.youkuaiyun.com/peter_code/article/details/150280325https://blog.youkuaiyun.com/peter_code/article/details/150280325peter_codeWed, 13 Aug 2025 18:53:03 +0800https://blog.youkuaiyun.com/peter_code/article/details/150101200https://blog.youkuaiyun.com/peter_code/article/details/150101200peter_codeSat, 09 Aug 2025 09:46:39 +0800https://blog.youkuaiyun.com/peter_code/article/details/139032261https://blog.youkuaiyun.com/peter_code/article/details/139032261peter_codeSun, 19 May 2024 17:49:58 +0800https://blog.youkuaiyun.com/peter_code/article/details/127521295https://blog.youkuaiyun.com/peter_code/article/details/127521295peter_codeWed, 26 Oct 2022 19:36:24 +0800https://blog.youkuaiyun.com/peter_code/article/details/127436536https://blog.youkuaiyun.com/peter_code/article/details/127436536peter_codeMon, 24 Oct 2022 22:19:44 +0800https://blog.youkuaiyun.com/peter_code/article/details/127435155https://blog.youkuaiyun.com/peter_code/article/details/127435155peter_codeFri, 21 Oct 2022 07:00:00 +0800https://blog.youkuaiyun.com/peter_code/article/details/126409820https://blog.youkuaiyun.com/peter_code/article/details/126409820peter_codeThu, 18 Aug 2022 17:21:57 +0800https://blog.youkuaiyun.com/peter_code/article/details/126119957https://blog.youkuaiyun.com/peter_code/article/details/126119957peter_codeTue, 02 Aug 2022 18:14:27 +0800https://blog.youkuaiyun.com/peter_code/article/details/126108321https://blog.youkuaiyun.com/peter_code/article/details/126108321peter_codeMon, 01 Aug 2022 20:38:26 +0800https://blog.youkuaiyun.com/peter_code/article/details/126097821https://blog.youkuaiyun.com/peter_code/article/details/126097821peter_codeMon, 01 Aug 2022 18:46:57 +0800https://blog.youkuaiyun.com/peter_code/article/details/125791749https://blog.youkuaiyun.com/peter_code/article/details/125791749peter_codeThu, 14 Jul 2022 20:11:59 +0800https://blog.youkuaiyun.com/peter_code/article/details/125471521https://blog.youkuaiyun.com/peter_code/article/details/125471521peter_codeSun, 26 Jun 2022 17:08:02 +0800https://blog.youkuaiyun.com/peter_code/article/details/125415267https://blog.youkuaiyun.com/peter_code/article/details/125415267peter_codeWed, 22 Jun 2022 21:05:45 +0800https://blog.youkuaiyun.com/peter_code/article/details/124925712https://blog.youkuaiyun.com/peter_code/article/details/124925712peter_codeMon, 23 May 2022 14:23:32 +0800https://blog.youkuaiyun.com/peter_code/article/details/124566685https://blog.youkuaiyun.com/peter_code/article/details/124566685peter_codeWed, 04 May 2022 10:44:15 +0800