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

class Solution:
    def longestObstacleCourseAtEachPosition(self, obstacles: List[int]) -> List[int]:
        n = len(obstacles)
        order = []
        result = []
        for i, obstacle in enumerate(obstacles):
            if len(order) == 0 or order[-1] <= obstacle:
                order.append(obstacle)
                result.append(len(order))
            else:
                index = bisect.bisect_right(order, obstacle)
                order[index] = obstacle
                result.append(index+1)
        return result