hdoj 4578 Transformation 【线段树区间加、乘、修改、幂次求和】

最新推荐文章于 2022-04-14 11:18:10 发布

笑着走完自己的路

最新推荐文章于 2022-04-14 11:18:10 发布

阅读量2k

点赞数

分类专栏：线段树

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/50485423

版权

博客内容介绍了如何使用线段树处理区间加、乘、修改和求c次方之和的问题，详细阐述了lazy propagation的优化策略，包括lazy1、lazy2和lazy3的标记更新，并给出了AC代码。

摘要由CSDN通过智能技术生成

Transformation

Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others)
Total Submission(s): 3869 Accepted Submission(s): 956

Problem Description

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.

Input

There are no more than 10 test cases.
For each case, the first line contains two numbers n and m, meaning that there are n integers and m operations. 1 <= n, m <= 100,000.
Each the following m lines contains an operation. Opera