POJ2559-Largest Rectangle in a Histogram(单调栈)
来源:互联网 发布:卸载kingroot的软件 编辑:程序博客网 时间:2024/06/01 08:40
Largest Rectangle in a Histogram
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20233 Accepted: 6502
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.
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 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
84000
Hint
Huge input, scanf is recommended.
Source
Ulm Local 2003
题意:宽度为1,高度不等,求最大矩形面积
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <stack>#include <queue>#include <vector>#include <map>using namespace std;#define ll long longint n;ll a[100090];ll l[100090],r[100090];int main(){ while(~scanf("%d",&n)&&n) { for(int i=1;i<=n;i++) scanf("%lld",&a[i]); a[0]=-1;a[n+1]=-1; stack<int>s; for(int i=1;i<=n+1;i++) { while(!s.empty()&&a[i]<a[s.top()]) r[s.top()]=i-1,s.pop(); s.push(i); } for(int i=n;i>=0;i--) { while(!s.empty()&&a[i]<a[s.top()]) l[s.top()]=i+1,s.pop(); s.push(i); } ll ans=-1; for(int i=1;i<=n;i++) ans=max(ans,a[i]*(r[i]-l[i]+1)); printf("%lld\n",ans); } return 0;}
0 0
- POJ2559 Largest Rectangle in a Histogram(单调栈)
- [POJ2559]Largest Rectangle in a Histogram(单调栈)
- POJ2559-Largest Rectangle in a Histogram(单调栈)
- Largest Rectangle in a Histogram POJ2559(单调栈模板)
- poj2559---Largest Rectangle in a Histogram(单调栈)
- POJ2559 Largest Rectangle in a Histogram [单调栈]
- 单调栈 poj2559 Largest Rectangle in a Histogram
- POJ2559 Largest Rectangle in a Histogram(单调栈)
- poj2559 Largest Rectangle in a Histogram(单调栈)
- 单调栈--poj2559 Largest rectangle in a Histogram
- poj2559 Largest Rectangle in a Histogram (单调栈)
- POJ2559--Largest Rectangle in a Histogram(栈)
- POJ2559 Largest Rectangle in a Histogram(DP)
- poj2559 Largest Rectangle in a Histogram
- poj2559 Largest Rectangle in a Histogram
- 【POJ2559】Largest Rectangle in a Histogram
- Largest Rectangle in a Histogram-POJ2559
- POJ2559 Largest Rectangle in a Histogram
- 27. Remove Element
- 字符串在文件中的读写
- 判断一个字符串是不是回文字符串
- 野指针形成原理、造成的危害及避免方法
- Android Studio查看一个页面的布局层次结构
- POJ2559-Largest Rectangle in a Histogram(单调栈)
- Ansible无法远程连接客户机
- linux/mac下的自定义命令alias
- Struts2---Action,action,ActionContext
- poj1062 昂贵的聘礼interesting-
- HDU2068 RPG的错排
- 左右结合 和优先级
- JavaScript的关键字和保留字
- js 向dom对象中存储变量