Axial-Tilted's blog

By Axial-Tilted, history, 5 weeks ago, In English

i've read the tutorial for this problem over 30 times and looked at many codes and it still doesnt make sense , why are we using dsu ? how does adding an edge between node a and b with weight c determine all the values on the simple path from a to b ?

if somebody had solved it i would appreciate it if u write an explanation

1615D - X(or)-mas Tree

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Axial-Tilted (previous revision, new revision, compare).