HDU 1056 Largest Rectangle in a Histogram(dp)(求最大的矩形面积)
来源:互联网 发布:上海行知实验学校 编辑:程序博客网 时间:2024/04/28 20:16
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
Recommend
思路:以每一行的高度为高,看左右分别可以延伸到哪里,算出面积求优解
代码:
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;#define N 100005__int64 h[N],le[N],ri[N];int main(){ __int64 n,i; while(scanf("%I64d",&n),n) { for(i=1;i<=n;i++) { scanf("%I64d",&h[i]); le[i]=ri[i]=i; } for(i=1;i<=n;i++) while(le[i]>1&&h[le[i]-1]>=h[i]) le[i]=le[le[i]-1]; for(i=n;i>=1;i--) while(ri[i]<n&&h[ri[i]+1]>=h[i]) ri[i]=ri[ri[i]+1]; __int64 ans=0; for(i=1;i<=n;i++) { __int64 temp=((ri[i]-le[i]+1)*h[i]); if(temp>ans) ans=temp; } printf("%I64d\n",ans); } return 0;}
0 0
- HDU 1056 Largest Rectangle in a Histogram(dp)(求最大的矩形面积)
- Hdu 1506 Largest Rectangle in a Histogram (DP求最大长方形面积)
- POJ 2559 Largest Rectangle in a Histogram (DP最大矩形面积)
- HDU 1506 Largest Rectangle in a Histogram (最大子矩形面积)
- poj 2559 Largest Rectangle in a Histogram 求面积最大的矩形(单调栈)
- HDU 1506 Largest Rectangle in a Histogram(dp求最大子矩阵和)
- hdu 1506 Largest Rectangle in a Histogram(求最大的矩形)
- Largest Rectangle in a Histogram(动态规划找最大矩形面积)
- Poj 2559 Largest Rectangle in a Histogram(柱形统计图中的最大矩形面积)
- HDU 1506 Largest Rectangle in a Histogram(最大矩形面积、单调栈)
- LeetCode | Largest Rectangle in Histogram(直方图围城的最大矩形面积)
- Largest Rectangle in Histogram 直方图中最大的矩形面积
- Largest Rectangle in Histogram 一排矩形中的最大的面积
- POJ 2559 &&HDU 1506 Largest Rectangle in a Histogram && 51nod 1102 面积最大的矩形 单调栈的应用
- HDU 1506 Largest Rectangle in a Histogram(最大连续矩阵面积)
- hdu 1506 Largest Rectangle in a Histogram【最大长方形面积】
- HDU 1506 Largest Rectangle in a Histogram(DP)
- hdu 1506 Largest Rectangle in a Histogram(DP)
- 单词计数
- 第二章 Java核心-对象与类
- USACO Camelot
- vim详解2
- Android下集成FacebookSDK
- HDU 1056 Largest Rectangle in a Histogram(dp)(求最大的矩形面积)
- 满足条件的最小组合数m
- 配置Openstack时,遇到的错误总结
- 通过实例理解javascript 的call()与apply()
- Redis源码分析(十二)--- redis-check-dump本地数据库检测
- 10790 - How Many Points of Intersection?
- Redis学习笔记6--Redis事务
- maple minimax函数
- C++实现链表逆序