Data structure challenge: application
Posted on April 7, 2020
Tagged balanced, challenge, competitive, data, empty, full, Kattis, log, rank, rightmost, select, slot, structure, tree, union-find
Tagged balanced, challenge, competitive, data, empty, full, Kattis, log, rank, rightmost, select, slot, structure, tree, union-find
I forgot to mention this in my previous post, but the thing which got me thinking about the predecessor problem in the first place was this competitive programming problem on Open Kattis:
I challenge you to go and solve it using your favorite technique from the previous post. (The connection between this Kattis problem and the predecessor problem is not immediately obvious, but I have to leave you something to puzzle over!)