How to implement 2D Segment Tree Range Updates/Queries?
Difference between en1 and en2, changed 15 character(s)
According to [user:rekt_n00b,2018-05-19], it is possible: [his comment](http://mirror.codeforces.com/blog/entry/852646390?#comment-181093308437)↵
↵
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?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English brdy 2018-05-19 19:02:15 15
en1 English brdy 2018-05-19 18:20:43 462 Initial revision (published)