[HELP] Sum of K-largest numbers in a range (using Merge Sort Tree?)

Правка en1, от Aritra741, 2020-09-06 09:37:18

I was wondering if it's possible to use Merge Sort Tree to find out the sum of K-largest numbers in a range. I've seen people solve it using Wavelet tree and Persistent Segment Tree. I failed to implement Merge Sort Tree in such a way that it solves the given task and now wondering if it's possible to do so.

Теги #data structures, #merge sort tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Aritra741 2020-09-06 09:37:18 392 Initial revision (published)