2-D segment tree with less memory

Правка en1, от zeref_dragoneel, 2017-04-05 20:54:04

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?

Теги 2d segment tree, segment trees, interval tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский zeref_dragoneel 2017-04-05 20:54:47 0 (published)
en1 Английский zeref_dragoneel 2017-04-05 20:54:04 348 Initial revision (saved to drafts)