这篇训练日记介绍了如何解决HDU5306 Gorgeous Sequence的问题，涉及到使用线段树进行区间更新、查询最大值和求和操作。在面对大规模数据时，单纯使用线段树会导致超时，因此提出了优化策略，维护区间最大值、严格次大值和最大值个数，通过巧妙的更新方式避免了复杂度爆炸。此外，还提供了相关问题的扩展讨论和代码实现。
Description
There is a sequence a of length n. We use ai to denote the i-th element in this sequence. You should do the following three types of operations to this sequence.
0 x y t: For every x≤i≤y, we use min(ai,t) to replace the original ai’s value.
1 x y: Print the maximum value of ai that x≤i≤y.
2 x y: Print the sum of ai that x≤i≤y
Input
The first line of the input is a single integer T, indicating the number of testcases.
The first line contains two integers n and m denoting the length of the sequence and the number of operations.
The second line contains n separated integers a1,…,an (∀1≤i≤n,0≤ai<231).
Each of the following m lines represents one operation (1≤x≤y≤n,0≤t<231).
It is guaranteed that T=100, ∑n≤1000000, ∑m≤1000000
Output
For every op
最低0.47元/天 解锁文章
扫一扫
728
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
