Every season at the fen lights of Will-o-Wisp, someone must rebuild the damaged itinerary. This year the task falls to Tailor, armed only with the windows register. 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 <= 1727; 0 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1727; 0 <= a[i] <= 1000000000.
