Number of Visible People in a Queue

For each person in an array of distinct heights, compute how many people to their right are "visible" (j is visible from i if every person between i and j is shorter than both). The problem reduces to a right-to-left scan using a monotonic-decreasing stack to efficiently count consecutive shorter people until a taller person blocks visibility (n up to 1e5).