Trapping Rain Water

Xem dạng PDF

Gửi bài giải

Điểm: 1,00 (OI)
Giới hạn thời gian: 1.0s
Giới hạn bộ nhớ: 256M
Input: stdin
Output: stdout

Người đăng:
Dạng bài
Ngôn ngữ cho phép
C, C++, Java, Kotlin, Pascal, PyPy, Python, Scratch

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

histogram

Input

The first line contains integer n, representing the number of bars in elevation map

The second line contains n integers, representing the height of each bar in the elevation map

Output

Print an integer which is how much water it can trap after raining.

Example

Input
12
0 1 0 2 1 0 1 3 2 1 2 1
Output
6
Explanation

The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.


Bình luận

Hãy đọc nội quy trước khi bình luận.


Không có bình luận tại thời điểm này.