3 жыл бұрын
Пікірлер
@yceraf 6 ай бұрын
This is the best video I could find about the algorithm, but sill is wrong, following his explanation the leaf node 9, (min 46:37) it should be node 10 and therefore wrong. because " i - active_length" i = 10, active_length = 0. Then how is possible? I tried to make the implementation but in some cases crash or put wrong leaf node index
@accountmy4622 4 ай бұрын
had the same question. The index and active_length didn't work from moving to new active node X and Y
@daviddugar3483 3 ай бұрын
it is possible bcs active_length for this equation is actually 2 not 0 (because we changed the 'root' to the node which if pointed to by 'na' edge)
@mhliu5017 7 ай бұрын
Amazing video❤
@abhijit-sarkar Жыл бұрын
I counted 3 billions okays.
@imatrixx572 Жыл бұрын
Thanks god, you saved my live.
@saliadel5238 2 жыл бұрын
Nice bro you saved my project I really need that explanation ❤
@jbm5195 2 жыл бұрын
Why are the inequalities reversed when in fact log is an increasing function?