Leetcode: Largest Rectangle in Histogram in C++

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].

The largest rectangle is shown in the shaded area, which has area = 10 unit.

For example,
Given height = [2,1,5,6,2,3],
return 10.

Solution:
int largestRectangleArea(vector<int> &height) {
        stack<int> p;
        int i = 0, m = 0;
        height.push_back(-1);
        while(i < height.size()) {
        if(p.empty() || height[p.top()] < height[i])
        {
            p.push(i);
            i++;
        }
        else {
            int t = p.top();
            p.pop();
            m = max(m, height[t] * (p.empty() ? i : i - p.top() - 1 ));
        }
    }
    return m;
    }