Largest Rectangle in a Histogram(动态规划找最大矩形面积)
来源:互联网 发布:斗破沙城翅膀进阶数据 编辑:程序博客网 时间:2024/05/01 20:23
Largest Rectangle in a Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13480 Accepted Submission(s): 3817
Problem 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
Source
University of Ulm Local Contest 2003
这个题特别有意思!就是给你若干个高度不一的正方形,让你找
出这里面面积最大的长方形!
这一题用到了动态规划,原理是这样的!每一个图形都有一个
h[i],l[i],r[i]!其中l[i]存的是左数至少比他高的图形的序数,r[i]存
的是右数至少比他高的图形的序数!这一题数目庞大!所以这一
点 while(h[r[i]+1]>=h[i]) {r[i]=r[r[i]+1];}特别重要!看右面有没
有比他大的,有就看右面那个r[]存的序数是多少,一步一步最
终找到连续的长方形!
#include<cstdio>#include<iostream>const int N=110000;using namespace std;long long h[N],l[N],r[N];int main(){ long long n; int i; while(scanf("%lld",&n)&&n) { for(i=1;i<=n;i++) { scanf("%lld",&h[i]); l[i]=r[i]=i; } h[0]=h[n+1]=-1; for(i=1;i<=n;i++) { while(h[l[i]-1]>=h[i]) { l[i]=l[l[i]-1];//这个体现动态规划的思想,存l[l[i]-1]而不是l[i]-1 }//这样就可以节省其中很多的步骤!根据动态规划原理这一找 } for(i=n;i>=1;i--) { while(h[r[i]+1]>=h[i]) { r[i]=r[r[i]+1]; } } long long maxs=-5,flag; for(i=1;i<=n;i++) { flag=(r[i]-l[i]+1)*h[i]; if(flag>maxs) { maxs=flag; } } printf("%lld\n",maxs); }}
0 0
- Largest Rectangle in a Histogram(动态规划找最大矩形面积)
- hdu 1507 Largest Rectangle in a Histogram 动态规划计算最大面积
- HDU 1056 Largest Rectangle in a Histogram(dp)(求最大的矩形面积)
- HDU 1506 Largest Rectangle in a Histogram (最大子矩形面积)
- POJ 2559 Largest Rectangle in a Histogram (DP最大矩形面积)
- Poj 2559 Largest Rectangle in a Histogram(柱形统计图中的最大矩形面积)
- Largest Rectangle in Histogram 直方图中最大的矩形面积
- Largest Rectangle in Histogram 一排矩形中的最大的面积
- 最大矩形面积 84 largest rectangle in histogram
- HDU 1506 Largest Rectangle in a Histogram(最大矩形面积、单调栈)
- poj 2559 Largest Rectangle in a Histogram 求面积最大的矩形(单调栈)
- POJ 2559 Largest Rectangle in a Histogram(单调栈维护最大矩形面积)
- HDU1506--Largest Rectangle in a Histogram (动态规划)
- zoj1985 hdu1506 Largest Rectangle in a Histogram (动态规划)
- hdu 1506 Largest Rectangle in a Histogram【最大长方形面积】
- LeetCode | Largest Rectangle in Histogram(直方图围城的最大矩形面积)
- [C++]LeetCode: 133 Largest Rectangle in Histogram(最大矩形面积)
- Largest Rectangle in Histogram (直方图中最大面积) 【leetcode】
- 第十三周项目3:立体类族共有的抽象类
- EEPROM和flash的区别
- Java Note - Everything is an object
- codeforces/#305 Div1/547/C Mike and Foam 【容斥】
- C实现简单web服务器-1(windows)
- Largest Rectangle in a Histogram(动态规划找最大矩形面积)
- 清平调 · 李白
- [编程题] 奇数位上都是奇数或者偶数位上都是偶数
- 关于hibernate通过注解方式自动生成表时字段的顺序问题
- makefile小记v2
- C++实现Bellmanford算法
- akoj-1272-字母统计
- linux下的apache配置文件详解
- 汇编指令解释大全