MLE with persistent segment tree

Правка en3, от svg_af, 2016-01-12 14:12:13

Hello there

I'm trying to solve this problem

I'm keeping a persistent segment tree from end to begin for the cnt[] array which keeps the number of results of indexes so far

and then for each elemnt in array i query on the tree next to the number and get how many indexes with smaller results

Here is my submission

is 10^6 too much for a persistent segment tree, or am i doing something wrong ?

Thanks in advance :D

Теги persistent segment trees, mle

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский svg_af 2016-01-12 14:12:13 1 Tiny change: 'Here is my[submissio' -> 'Here is my [submissio'
en2 Английский svg_af 2016-01-12 14:11:49 12
en1 Английский svg_af 2016-01-12 14:11:06 556 Initial revision (published)