How to implement 2D Segment Tree Range Updates/Queries?

Правка en1, от brdy, 2018-05-19 18:20:43

According to animeshf, it is possible: his comment

But the implementation link he shared is expired so the implementation is gone! I'm confused one how to lazily propagate changes in the second dimension, more specifically how to store the lazy updates in a way so that both operations are logn^2 worst case.

Any ideas here?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский brdy 2018-05-19 19:02:15 15
en1 Английский brdy 2018-05-19 18:20:43 462 Initial revision (published)