Largest Rectangle in Histogram

标签：

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.

int largestRectangleArea(vector<int>& height) {
int maxV = 0;
for(int i =0; i< height.size(); i++)
{
if(i+1 < height.size()
&& height[i] <= height[i+1]) // if not peak node, skip it
continue;
int minV = height[i];
for(int j =i; j>=0; j--)
{
minV = std::min(minV, height[j]);
int area = minV*(i-j+1);
if(area > maxV)
maxV = area;
}
}
return maxV;



}

Largest Rectangle in Histogram

标签：

原文地址：http://www.cnblogs.com/hexhxy/p/4817961.html