of distinct integers where heights[i] represents the height of the ith person.

A person can see another person to their right in the queue if everybody in between is shorter than both of them. More formally, the ith person can see the jth person if i < j and min(heights[i], heights[j]) > max(heights[i+1], heights[i+2], ..., heights[j-1]).

Return an arrayanswer of lengthn whereanswer[i]_is thenumber of people the _ith person cansee to their right in the queue.

Examples

Example 1

 
![](https://assets.leetcode.com/uploads/2021/05/29/queue-plane.jpg)
 
Input

Related Tags