1944. Number of Visible People in a Queue

There are n people standing in a queue, and they numbered from 0 to n - 1 in left to right order. You are given an array heights 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 array answer of length n where answer[i] is the number of people the ith person can see to their right in the queue.

class Solution {
public:
    vector<int> canSeePersonsCount(vector<int>& heights) {
        int n = heights.size();
        vector<set<int>> higher(n, set<int>());
        vector<int> res(n, 0);
        for(int i = n -2; i >= 0; i--) {
            if(heights[i] <= heights[i + 1]) higher[i].insert(i + 1);
            else {
                set<int> s{i + 1};
                queue<int> q;
                q.push(i + 1);
                while(!q.empty()) {
                    auto pos = q.front();
                    q.pop();
                    if(heights[i] > heights[pos]) {
                        res[i]++;
                        for(auto& higher : higher[pos]) {
                            if(!s.count(higher)) {
                                q.push(higher);
                                s.insert(higher);
                            }
                        }
                    } else {
                        higher[i].insert(pos);
                    }
                }
            }
            res[i]  += higher[i].size();
        }
        return res;
    }
};

class Solution {
public:
    vector<int> canSeePersonsCount(vector<int>& heights) {
        int n = heights.size();
        vector<int> res(n, 0), st;
        for(int i = 0; i < n; i++) {
            while(!st.empty() and heights[st.back()] <= heights[i]) {
                res[st.back()]++;
                st.pop_back();
            }
            if(!st.empty()) res[st.back()]++;
            st.push_back(i);
        }
        return res;
    }
};