Finding the k-th Smallest Element in a Range with Parallel Binary Search.
A new way to solve this problem with binary search.
By Thiago Felipe Bastos da Silva
If you don’t know Yosupo, it’s a site for testing Competitive Programming libraries. For that, there are some problems on ranges, geometry, data structures, strings, and others. Here I’m going to talk about one problem called Range Kth Smallest, which is basically about finding the k-th element inside an interval...
[Read More]