单调栈结构

#include<vector>
#include<stack>
using namespace std;
vector<vector<int>> func(vector<int>& arr)
{
    int len = arr.size();
    stack<int> stack1;
    vector<vector<int>> ret(len, vector<int>(2));
    for (int front = 0; front < len; ++front )
    {
        while (!stack1.empty() && arr[stack1.top()] > arr[front])
        {
            int TopIndex = stack1.top();
            stack1.pop();
            ret[TopIndex][1] = front;
            ret[TopIndex][0] = stack1.empty() ? -1 : stack1.top();
        }
        stack1.push(front);
    }
    while (!stack1.empty())
    {
        int TopIndex = stack1.top();
        stack1.pop();
        ret[TopIndex][1] = -1;
        ret[TopIndex][0] = stack1.empty() ? -1 : stack1.top();
    }
    return ret;
}
int main()
{
    vector<int> arr{ 3,4,1,5,6,2,7 };
    vector<vector<int>> ret = func(arr);
    for (int i = 0; i < ret.size(); ++i)
    {
        cout << "[";
        cout << ret[i][0] << "," << ret[i][1];
        cout << "]" << endl;
    }
    return 0;
}