Largest Rectangle in a Histogram

Largest Rectangle in a Histogram

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 103   Accepted Submission(s) : 20

Problem Description

A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of rectangles with the heights 2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles: 

Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histogram.

 

Input

The input contains several test cases. Each test case describes a histogram and starts with an integer <i>n</i>, denoting the number of rectangles it is composed of. You may assume that <i>1<=n<=100000</i>. Then follow <i>n</i> integers <i>h₁,...,h_n</i>, where <i>0<=h_i<=1000000000</i>. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is <i>1</i>. A zero follows the input for the last test case.

 

Output

For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.

 

Sample Input

  
  

   
   7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0

  
  

 

Sample Output

  
  

   
   8
4000
  
  
  
  

   
   题意：有n个连在一起的长方形，高不一样，宽都是1，给出每个长方形的高，
  
  
  
  

   
   求这些长方形组成的长方形的最大的面积（基本就这么个意思吧，可以使竖着的也能是横着的）
  
  
  
  

   
   思路：求出每个长方形左面右面比他高的长方形来，乘以高就行了
  
  
  
  

   
   关键在于如何找到左右两面比他本身高的长方形的位置
  
  
  
  

   
   定义两个数组l r 分别是左右两面比i高的停止的位置
  
  
  
  

   
   这样就ok了    l[i]=l[l[i]-1];  找到符合的  左界往左移一个  有界同理
  
  
  
  

   
   #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int map[100010];
int l[100010],r[100010];
int main()
{
    int i,j;
    int n;
    /*int gg;
    cin>>gg;
    if(gg>1000000000)
    cout<<1<<endl;*/
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)break;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&map[i]);
            l[i]=i;
            r[i]=i;
        }
        for(i=1;i<=n;i++)
        {
            while(l[i]>1&&map[l[i]-1]>=map[i])
                l[i]=l[l[i]-1];
            }
        for(i=n;i>=1;i--)
        {
            while(r[i]<n&&map[r[i]+1]>=map[i])
                r[i]=r[r[i]+1];
            }
        long long temp,max=0;
        for(i=1;i<=n;i++)
        {
            temp=(long long)(r[i]-l[i]+1)*map[i];
            if(temp>max)
            max=temp;
            }
        cout<<max<<endl;
    }
    return 0;
    }