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.

Sample Input

7 2 1 4 5 1 3 3
4 1000 1000 1000 1000

Sample Output


hide comments
scorpion_ajay: 2017-01-22 17:44:45

it seems easy first, but then you are screwed XD

sarvagya: 2016-12-06 08:33:59

O(n) without a stack ^_^

Shubham: 2016-12-03 16:54:36

Accepted, But In g++ 5.1, I have to use long long for both n and heights....I thought long should suffice ( < 10^9).

chinmay0906: 2016-10-29 07:24:33

the best problem on stack....O(n) solution

davidgalehouse: 2016-10-16 23:22:42

Wow, great problem. I looked at times after debating divide and conquer and O(n^2) approaches, and figured there must be an O(n) solution. Not sure if I got lucky thinking of a solution. Subconsciously at least, the experience of ARRAYSUB and HOTELS helped me.

Last edit: 2016-10-16 23:23:18
sieunhanbom04: 2016-08-19 19:15:20

printf("%lld\n",ans); = accepted;
printf("%I64d\n",ans); = WA;
(in C++ 14).

mohit_23: 2016-06-19 11:10:04

thank god. finally accepted

lt: 2016-06-17 09:15:29

AC on first go!
BTW segmentation fault loves segment trees! :P

Last edit: 2016-06-17 10:58:13
aspro: 2016-06-07 17:37:09

also solve CTGAME prob

ajay_5097: 2016-06-02 14:41:24

Segment tree ...

Added by:Wanderley Guimarăes
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