动态规划-Largest Rectangle in a Histogram- HOJ 1506
来源:互联网 发布:畑亚贵 知乎 编辑:程序博客网 时间:2024/06/05 22:36
Largest Rectangle in a Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7296 Accepted Submission(s): 2037
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
还有一个类似的题。
动态规划-面积最大的全1子矩阵
关键点都是遍历两次,找到左界限和右界限。
#include <stdio.h>typedef long long int64;int64 n;int64 arr[100002];int64 left[100002], right[100002];int main() {//freopen("input.txt", "r", stdin);while (scanf("%I64d",&n), n) {for (int i = 1; i <= n; i++) {scanf("%I64d",&arr[i]);}arr[0]=-1;arr[n+1]=-1;int64 tmp;for (int i = 1; i <= n; i++) { //求左界限tmp = i;while(arr[i] <= arr[tmp-1]) {tmp = left[tmp-1];}left[i] = tmp;}int64 ans = 0,max;for(int i=n; i>=1; i--) { //求右界限,同时求最大值tmp=i;//while(arr[i] <= arr[tmp+1]) {tmp = right[tmp+1];}right[i] = tmp;max = (tmp-left[i] + 1) * arr[i];if(max > ans)ans = max;}printf("%I64d\n",ans);}return 0;}
- 动态规划-Largest Rectangle in a Histogram- HOJ 1506
- HDU 1506 Largest Rectangle in a Histogram 【动态规划】
- hdu 1506 Largest Rectangle in a Histogram[动态规划]
- HDU 1506 动态规划(DP) Largest Rectangle in a Histogram
- hdoj-1506-Largest Rectangle in a Histogram【动态规划】
- HDU 1506(Largest Rectangle in a Histogram)动态规划
- HDU 1506 Largest Rectangle in a Histogram 动态规划
- HDU1506--Largest Rectangle in a Histogram (动态规划)
- POJ 2559 Largest Rectangle in a Histogram -- 动态规划
- zoj1985 hdu1506 Largest Rectangle in a Histogram (动态规划)
- POJ 2559 Largest Rectangle in a Histogram -- 动态规划
- 动态规划、搜索:POJ2559-Largest Rectangle in a Histogram
- hdu 1506 Largest Rectangle in a Histogram(动态规划,很棒的优化)
- 动态规划:E - Largest Rectangle in a Histogram(即HDU 1506)
- HDU 1505 Largest Rectangle in a Histogram && HDU 1506 City Game(动态规划)
- HDOJ 题目1506 Largest Rectangle in a Histogram(动态规划)
- hdu 1506 Largest Rectangle in a Histogram
- HDU 1506 Largest Rectangle in a Histogram
- android三种传输方案分析+一个注册登录例子
- Glances -系统监控工具(Python)
- asp.net清除页面缓存
- Dalvik虚拟机JNI方法的注册过程分析
- SSH公钥私钥认证原理
- 动态规划-Largest Rectangle in a Histogram- HOJ 1506
- 区分Activity的四种加载模式
- ./buile_native.sh出现please define NDK_ROOT解决方法
- 为VS2005工程添加新的SDK
- ASP、JSP、PHP 三种技术比较
- window.onload与document.ready的区别
- oracle log file switch (checkpoint incomplete) 解决
- Android的onCreateOptionsMenu()创建菜单Menu详解
- \n \r 理解