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

最新推荐文章于 2026-04-21 02:25:42 发布

原创

最新推荐文章于 2026-04-21 02:25:42 发布 · 1.8k 阅读

标签

#线段树 #神题系列 #做的快哭了

收录于

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

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, th