Poj2559 Largest Rectangle in a Histogram

Source: Internet
Author: User

Poj2559 Largest Rectangle in a Histogram

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 N, Denoting the number of rectangles it is composed of. You may assume that 1 <= n <= 100000. Then follow NIntegers H1,..., hn, Where 0 <= hi <= 1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. 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 34 1000 1000 1000 10000

Sample Output

8

4000

This was previously done with dp, but now it is done with monotonous stacks.

 

#include
 
  #include
  
   #include
   
    #include
    
     #includeusing namespace std;#define ll long long#define maxn 100500struct node{ll count,h;}stack[maxn];int main(){int n,m,i,j;ll ans,sum1,top,count,tmp,a;while(scanf(%d,&n)!=EOF && n!=0){top=0;ans=0;for(i=1;i<=n;i++){scanf(%lld,&a);count=0;while(top>0 && stack[top].h>=a){stack[top].count+=count;count=stack[top].count;sum1=count*stack[top].h;if(ans
     
      0){stack[top].count+=count;count=stack[top].count;sum1=count*stack[top].h;if(ans
      
       

 

 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.