path: root / Practicum / pract06 / solutions / Task 01.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

#include <vector>
#include <stack>

class Solution
{
public:
    std::vector<int> nextGreaterElements(std::vector<int> &nums)
    {
        std::stack<std::pair<int, int>> stack;
        std::vector<int> ans(nums.size(), -1);
        for (int i = 0; i < nums.size(); ++i)
        {
            while (!stack.empty() && stack.top().first < nums[i])
            {
                ans[stack.top().second] = nums[i];
                stack.pop();
            }

            stack.emplace(nums[i], i);
        }

        for (int i = 0; i < nums.size(); ++i)
        {
            while (!stack.empty() && stack.top().first < nums[i])
            {
                ans[stack.top().second] = nums[i];
                stack.pop();
            }
        }

        return ans;
    }
};