poj2559 Largest Rectangle in a Histogram - c++编程基础

TOP

poj2559 Largest Rectangle in a Histogram

2015-11-21 00:57:25 来源: 作者: 【大中小】浏览:3次

Tags：poj2559 Largest Rectangle 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 n integers h₁,...,h_n, where 0<=h_i<=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 3
4 1000 1000 1000 1000
0

Sample Output

4000

这题之前是用dp做的，现在用单调栈做了一下。

#include
  
   
#include
   
     #include
    
      #include
     
       #include
      
        using namespace std; #define ll long long #define maxn 100500 struct 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
        
         ?


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：POJ 3069 Saruman's Army (简..	下一篇：UVA - 1382 Distant Galaxy

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: