【POJ 2559 Largest Rectangle in a Histogram】+ 栈
来源:互联网 发布:java 字符串拷贝 编辑:程序博客网 时间:2024/06/03 13:13
Largest Rectangle in a Histogram
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 20811 Accepted: 6697
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 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 3
4 1000 1000 1000 1000
0
Sample Output
8
4000
Hint
Huge input, scanf is recommended.
Source
Ulm Local 2003
依据当前的矩形高度,向左向右,分别找出小于当前矩形高度的位置?
AC代码:
#include<cstdio>#include<algorithm>using namespace std;const int K = 1e5 + 10;typedef long long LL;LL l[K],r[K],a[K],h[K];int main(){ int N; while(scanf("%d",&N) != EOF && N){ for(int i = 0; i < N; i++) scanf("%lld",&h[i]); int nl = 0; for(int i = 0; i < N; i++){ while(nl && h[a[nl - 1]] >= h[i]) nl--; l[i] = nl == 0 ? 0 : a[nl - 1] + 1,a[nl++] = i; } nl = 0; for(int i = N - 1; i >= 0; i--){ while(nl && h[a[nl - 1]] >= h[i]) nl--; r[i] = nl == 0 ? N : a[nl - 1],a[nl++] = i; } LL ans = 0; for(int i = 0; i < N; i++) ans = max(ans,(r[i] - l[i]) * h[i]); printf("%lld\n",ans); } return 0;}
- poj 2559 Largest Rectangle in a Histogram
- POJ 2559 - Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- 【poj 2559】Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- POJ 2559Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- Largest Rectangle in a Histogram(POJ-2559)
- 集合框架
- mysql开远程访问权限
- 20pin J-link使用SWD模式连接蓝宙K60DN512核心板
- throws和throw以及Finally的用法
- vmware vsphere环境搭建
- 【POJ 2559 Largest Rectangle in a Histogram】+ 栈
- opengl入门一
- poj 2282 The Counting Problem && poj 3286 How many 0's? (数位dp)
- LeetCode修炼之路(Easy系列)
- 500G 视频网盘分享
- perl基本语法概述
- hi3520d烧写开发板遇到的问题及其解决方法
- MXNet官方文档教程(6):神经网络图
- 大败局I,多元化是个陷阱吗?