2-D segment tree with less memory
Difference between en1 and en2, changed 0 character(s)
Hi,↵
↵
I am trying to implement a 2-D segment tree, seg with N = 100000... The catch is that I only need to get the query answer for Q(100000) nodes say query(i,j) : denoting the value in seg[i][j]... but i need to online (lazily) update the seg tree, seg[lx...rx][ly...ry].↵
↵
Can anyone help me with this problem?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English zeref_dragoneel 2017-04-05 20:54:47 0 (published)
en1 English zeref_dragoneel 2017-04-05 20:54:04 348 Initial revision (saved to drafts)