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.

제약 조건

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

예시

입력:
heights = [2, 1, 5, 6, 2, 3]

예상 출력:
expected = 10

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

예상 출력:
long long expected = 10;

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

예상 출력:
long expected = 10;

입력:
heights = [4]

예상 출력:
expected = 4

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

예상 출력:
long long expected = 4;

입력:
long[] heights = new long[] {4};

예상 출력:
long expected = 4;

참고 자료

이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.

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