Submit | All submissions | Best solutions | Back to list |
HISTOGRA - Largest Rectangle in a Histogram |
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.
Input Specification
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 Specification
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.
Example
Input: 7 2 1 4 5 1 3 3 4 1000 1000 1000 1000 0 Output: 8 4000
Added by: | Wanderley Guimarăes |
Date: | 2007-09-21 |
Time limit: | 0.800s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO |
Resource: | University of Ulm Local Contest 2003 |
hide comments
|
||||||||||||||
2015-07-19 21:36:25 Varun Gambhir
Divide and conquer(n*log(n)) ! :) |
||||||||||||||
2015-07-07 22:17:01 Proxy
getting runtime error SIGSEGV..plz help link to ideone solution: <snip> Last edit: 2022-08-29 22:48:01 |
||||||||||||||
2015-06-22 17:10:11 n3gativ3
nice problem..just use long long..it costed me 1 WA.. |
||||||||||||||
2015-06-01 03:34:09 Hikari9
Beautiful problem. Solvable using a range of O(n), O(n log n), and even O(n sqrt n) solutions :)) Last edit: 2015-06-01 03:37:41 |
||||||||||||||
2015-04-02 18:45:12 Min_25
I cannot see it (Google Chrome). (Francky) => And now ? (it was the .pl 'bug') (Min_25) Now, I can see it ! Last edit: 2015-04-02 20:14:30 |
||||||||||||||
2015-04-02 18:10:42 Francky
I can see the image ! (Image updated or not ???) Is anybody can't see it ? Please answer only if you can't see it. Thanks. |
||||||||||||||
2015-04-02 16:50:47 Phong
Can anyone describe the problem for me I cannot load the image @@ That's be very helpful. Thank you very much Edited: Nvm I found an image on google so thanks for your help :D Last edit: 2015-04-02 16:58:29 |
||||||||||||||
2015-01-09 12:47:36 californiagurl
nothing I do seems to work :/ and there are at least 3 different solution to this problem :' |
||||||||||||||
2014-12-27 12:49:06 agaurav77
Nice question. Remember to use everything as long long (C++), AC :) |
||||||||||||||
2014-12-23 12:42:15 Archit Jain
use long long int caused many wa Last edit: 2014-12-23 12:48:51 |