hdu1506 Largest Rectangle in a Histogram
来源:互联网 发布:什么是真正的大数据 编辑:程序博客网 时间:2024/06/05 00:31
Largest Rectangle in a Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6301 Accepted Submission(s): 1803
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
LL
///对于每一个a[i],用dp找出a[i]左边和右边连续大于自己的数的长度///l[i]表示比a[i]大的数连续的最左边的位置///r[i]表示比a[i]大的数连续的最右边的位置#include<iostream>#include<cstdlib>#include<stdio.h>#define LL long longusing namespace std;const int N=100010;LL a[N],l[N],r[N],maxn,s;int main(){ int n; while(scanf("%d",&n) && n) { for(int i=1;i<=n;i++) scanf("%I64d",&a[i]); l[1]=1; r[n]=n; for(int i=2;i<=n;i++) { int tt=i; while(tt>1&&a[i]<=a[tt-1]) tt=l[tt-1];///dp思想 l[i]=tt; } for(int i=n-1;i>=1;i--) { int tt=i; while(tt<n&&a[i]<=a[tt+1]) tt=r[tt+1]; r[i]=tt; } maxn=0; for(int i=1;i<=n;i++) { s=(r[i]-l[i]+1)*a[i]; if(s>maxn) maxn=s; } printf("%I64d\n",maxn); } return 0;}
- hdu1506 & pku2559 Largest Rectangle in a Histogram
- 【DP】 hdu1506 Largest Rectangle in a Histogram
- hdu1506 Largest Rectangle in a Histogram
- HDU1506--Largest Rectangle in a Histogram
- hdu1506 Largest Rectangle in a Histogram
- HDU1506 ( Largest Rectangle in a Histogram ) [dp]
- HDU1506 Largest Rectangle in a Histogram
- hdu1506 Largest Rectangle in a Histogram (DP)
- [HDU1506]Largest Rectangle in a Histogram[dp]
- HDU1506 Largest Rectangle in a Histogram
- hdu1506 Largest Rectangle in a Histogram
- ZOJ1985 POJ2259 HDU1506 Largest Rectangle in a Histogram
- poj2559 & zoj1985 &hdu1506 Largest Rectangle in a Histogram(笛卡尔树)
- HDU1506--Largest Rectangle in a Histogram (动态规划)
- HDU1506 Largest Rectangle in a Histogram (动规)
- hdu1506——Largest Rectangle in a Histogram
- hdu1506 Largest Rectangle in a Histogram (单调栈)
- zoj1985 hdu1506 Largest Rectangle in a Histogram (动态规划)
- Linux性能优化学习笔记V0.1
- C语言的那些小秘密之const修饰符
- 寒假集训作业(9)——动态规划初步(2)
- 练习CRM搭建笔记——1、Browser Side
- 如何保持注意力
- hdu1506 Largest Rectangle in a Histogram
- 天涯运维之服务器远程操作
- 软件随想录(local.joelonsoftware.com/wiki)-2000年04月18日 使用介面设计手冊第四章 - User Interface Design for Programmers
- 实现序列化几种方式的对比
- MySQL行锁深入研究
- Freemarker+Flying sauser +Itext 整合生成PDF
- webpy中配置发送邮件服务
- hciattach 分析
- ip地址检查正则表达式 兼容ipv4,ipv6