Largest Rectangle in a Histogram POJ
来源:互联网 发布:淘宝网新款针织衫 编辑:程序博客网 时间:2024/05/23 22:38
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.
The input contains several test cases. Each test case describes a histogram and starts with an integern, denoting the number of rectangles it is composed of. You may assume that1<=n<=100000. Then follow n integers h1,...,hn, where0<=hi<=1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is1. A zero follows the input for the last test case.
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.
7 2 1 4 5 1 3 34 1000 1000 1000 10000
84000
Huge input, scanf is recommended.
#include<cstdio>#include<cstring>#include<stack>#include<algorithm>#include<queue>using namespace std;const int M=100010;int n;int h[M],l[M],r[M],st[M];int main(){ while(scanf("%d",&n),n) { memset(l,0,sizeof(l)); memset(r,0,sizeof(r)); memset(st,0,sizeof(st)); for(int i=0;i<n;i++) scanf("%d",&h[i]); int t=0; for(int i=0;i<n;i++) { while(t>0&&h[st[t-1]]>=h[i]) t--; l[i]= t==0?0:(st[t-1]+1); st[t++]=i; } t=0; for(int i=n-1;i>=0;i--) { while(t>0&&h[st[t-1]]>=h[i]) t--; r[i]= t==0?n:(st[t-1]); st[t++]=i; } long long ans=0; for(int i=0;i<n;i++) { ans=max(ans,(long long)h[i]*(r[i]-l[i])); } printf("%lld\n",ans); } return 0;}
阅读全文
0 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:2556 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:Largest Rectangle in a Histogram
- poj 2559 Largest Rectangle in a Histogram
- JS刷新父窗口
- Android事件分发机制完全解析,带你从源码的角度彻底理解(下)
- 浅谈.h .cpp
- python基础入门四
- oracle中merge into用法
- Largest Rectangle in a Histogram POJ
- JS的函数参数传递
- 解决使用TortoiseGit后文件夹出现蓝色问号
- Drawerlayout侧滑菜单
- Android异步消息处理机制完全解析,带你从源码的角度彻底理解
- 精选20道Java多线程面试题并有答案! 互联网IT技术 2017-10-14 00:02 1. 多线程使用的优缺点? 优点: (1)多线程技术使程序的响应速度更快 (2)当前没有进行处理的任务
- 第一章课后习题
- 数据库探索之旅——数据类型
- hdu6183(线段树动态开点)