Dino runs the brewery at the steppe camp of Horselord Plains. Today the books show a list of scrolls, and the numbers must be worked out before sundown. Task: Heights a[i] form a skyline; after rain, water rests between higher bars. Print the total trapped water. Input format: First line: n. Second line: n nonnegative integers. Output format: Print the trapped water volume (fits 64-bit). Constraints: 1 <= n <= 1406; 0 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1406; 0 <= a[i] <= 1000000000.
