Help with TL on sum of distinct digits in range

Revision en1, by svg_af, 2016-02-09 17:02:28

Hello there

I'm trying to solve this problem with this code

Now what I'm doing is building a segment tree with a treap in each node that keeps the position of the next equal number in the array for every number in range

after numerous WAs i got TL and while testing my code on extreme cases i found out it really does take a very long time to execute for 50000 ... the extreme case

My code's complexity is supposedly N*log^2(N) which should be fast for this size of input

what am i doing that's so slow ??

please help :/

Tags segment tree, treap, tle

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English svg_af 2016-02-10 00:51:06 461
en1 English svg_af 2016-02-09 17:02:28 659 Initial revision (published)