Python实现线段树

最新推荐文章于 2023-06-05 05:05:40 发布

hyk今天写算法了吗

最新推荐文章于 2023-06-05 05:05:40 发布

阅读量341

点赞数 1

分类专栏： # 算法理论文章标签：算法数据结构 python

本文链接：https://blog.csdn.net/m0_52000372/article/details/125394880

版权

算法理论专栏收录该内容

16 篇文章 0 订阅

订阅专栏

class SegmentTreeDynamic:
    class Node:
        left, right = None, None
        val, add = 0, 0

        # def __init__(self, left, right, val, add):
        #     self.left = left
        #     self.right = right
        #     self.val = val
        #     self.add = add
        def __init__(self):
            pass

    N = int(1e9)
    root = Node()

    def update(self, node, start, end, l, r, val):
        if l <= start and end <= r:
            node.val += ((end - start) + 1) * val
            node.add = val
            return
        mid = (start + end) >> 1
        self.pushDown(node, mid - start + 1, end - mid)
        if l <= mid: self.update(node.left, start, mid, l, r, val)
        if r > mid: self.update(node.right, mid + 1, end, l, r, val)
        self.pushup(node)

    def pushup(self, node):
        node.val = node.left.val + node.right.val

    def pushDown(self, node, leftNum, rightNum):
        if node.left is None: node.left = self.Node()
        if node.right is None: node.right = self.Node()
        if node.add == 0: return
        node.left.val = node.add * leftNum
        node.right.val = node.add * rightNum
        node.add = 0

    def query(self, node, start, end, l, r):
        if l <= start and end <= r: return node.val
        mid, ans = (start + end) >> 1, 0
        self.pushDown(node, mid - start + 1, end - mid)
        if l <= mid: ans += self.query(node.left, start, mid, l, r)
        if r > mid: ans += self.query(node, mid + 1, end, l, r)
        return ans