Segment Tree lazy propagation

Правка en3, от Saber.HMN, 2019-07-08 17:38:17

I have an array of a [] that stores the value and some queries:

1: L R : increases the numbers in range [L, R] to K.

2: L R : find i (L <= i <= R) with a [i]> = a [j] (L <= j <= R)

I think about using segment trees, can you help me ? Sorry for my poor English.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский Saber.HMN 2019-07-08 20:29:18 291
en3 Английский Saber.HMN 2019-07-08 17:38:17 7
en2 Английский Saber.HMN 2019-07-08 17:36:33 8
en1 Английский Saber.HMN 2019-07-08 17:35:40 296 Initial revision (published)