Leetcode 1964. Find the Longest Valid Obstacle Course at Each Position

For each index i, compute the length of the longest non-decreasing subsequence (in original order and including i) that ends at i. With n up to 1e5, this is typically solved in O(n log n) using the LIS/patience-sorting pattern by maintaining tails and binary-searching for insert positions (allowing equal values).