HDU 4578 Transformation(线段树+做了4天的神题+详解)

最新推荐文章于 2024-08-19 01:03:13 发布

i-unique

最新推荐文章于 2024-08-19 01:03:13 发布

阅读量1.7k

点赞数 3

分类专栏：数据结构线段树 ACM 文章标签：线段树神题系列做的快哭了

本文链接：https://blog.csdn.net/qq_37497322/article/details/76355061

版权

本文详细剖析了HDU 4578神题的解题思路，重点讲解如何利用线段树解决这道让人费解的难题，分享了作者历经四天攻关的心得体会。

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

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. Operation 1 to 3 is in this format: "1 x y c" or "2 x y c"