HDU-4578 线段树懒惰标记的下推顺序（好题）

最新推荐文章于 2021-07-25 13:52:30 发布

原创

最新推荐文章于 2021-07-25 13:52:30 发布 · 1.2k 阅读

7 ·

CC 4.0 BY-SA版权

博客内容介绍了如何使用线段树处理区间多种修改操作，特别是区间加法对区间幂次和的影响。文章强调了更新和下推顺序的重要性，并提供了AC代码作为解决方案。

链接点击打开链接

Yuanfang is puzzled with the question below:
There are n integers, a ₁, a ₂, …, a _n. The initial values of them are 0. There are four kinds of operations.
Operation 1: Add c to each number between a _x and a _y inclusive. In other words, do transformation a _k<---a _k+c, k = x,x+1,…,y.
Operation 2: Multiply c to each number between a _x and a _y inclusive. In other words, do transformation a _k<---a _k×c, k = x,x+1,…,y.
Operation 3: Change the numbers between a _x and a _y to c, inclusive. In other words, do transformation a _k<---c, k = x,x+1,…,y.
Operation 4: Get the sum of p power among the numbers between a _x and a _y inclusive. In other words, get the result of a _x ^p+a _x+1 ^p+…+a _y ^p.
Yuanfang has no idea of how to do it. So he wants to ask you to help him.