375
CF-375-D
375-D 题目大意 给定一颗\(n\)个节点的树,根节点为\(1\),每个节点都有一个颜色\({c}_{i}\) 给定\(q\)次询问: \((x,k):\)询问在以\(x\)为根的子树中出现次数\({\ge}k\)的颜色数量 Solution 首先考虑一般暴力的做法,将所有询问离线下来,对整个树 ......
第 375 场周赛(滑动窗口,区间合并)
使用差分的思想进行解决 class Solution: def countTestedDevices(self, batteryPercentages: List[int]) -> int: diff = 0 for x in batteryPercentages: if x > diff: dif ......