Largest Rectangle in a Histogram

A histogram has bars of width 1 with the given heights. Find the area of the largest rectangle that lies entirely within the bars. A monotonic stack gives an O(n) solution.

Implement largest_rectangle(heights).

Input

heights: Bar heights from left to right.

Output

Return the largest area.

Restricciones

0 ≤ length ≤ 200,000; 0 ≤ height ≤ 1,000,000,000

Ejemplos

Entrada:
heights = [2, 1, 5, 6, 2, 3]

Salida esperada:
expected = 10

Entrada:
std::vector<long long> heights = {2, 1, 5, 6, 2, 3};

Salida esperada:
long long expected = 10;

Entrada:
long[] heights = new long[] {2, 1, 5, 6, 2, 3};

Salida esperada:
long expected = 10;

Entrada:
heights = [4]

Salida esperada:
expected = 4

Entrada:
std::vector<long long> heights = {4};

Salida esperada:
long long expected = 4;

Entrada:
long[] heights = new long[] {4};

Salida esperada:
long expected = 4;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• From Problems to Performance: Two Decades of Programming Contests in the CCSC Southeast