int getAnswer(int n,vector<int>&height)
{
heights.push_back(0);
int n = heights.size();
stack<int> st;
int ans = 0;
for(int i = 0;i<n;i++)
{
while(!st.empty() and heights[st.top()] >heights[i])
{
int a = st.top();
st.pop();
if (st.empty()) ans = max(ans, heights[a] * i);
else ans = max(ans,(i-st.top()-1)*heights[a]);
}
st.push(i);
}
return ans;
}