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.
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.
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
A zero follows the input for the last test case.
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.
7 2 1 4 5 1 3 3 4 1000 1000 1000 1000 0
I got 'time limit exceeded'
Could you please talk about the idea of solving the problem with stack?Last edit: 2019-12-08 14:17:06
Nice problem...excellent example of stack...
how to take number of test cases
Use everything as long long int
how to do it without stacks?
If you are using CPP, d&c, segment trees then just use long long everywhere ... you'll get ACLast edit: 2019-05-19 08:35:26
sparse table and binary search also works O(nlogn)
It can also be done using Union and Find in O(nlogn).