Conserving water saves energy. In many regions water gets collected between the valleys which is used for various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total units of water it can hold after raining. 2 • Height = [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. Input Format First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights of the valley. Constraints • n == height.length • 1 <= n <= 2* 104 0 <= height[i]<<= 105 Output Format Print a single line containing one positive integer, denoting the maximum amount of water that can be stored. Sample Input 0 12 0 1 0 2 1 0 1 3 2 1 2 1
Conserving water saves energy. In many regions water gets collected between the valleys which is used for various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total units of water it can hold after raining. 2 • Height = [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. Input Format First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights of the valley. Constraints • n == height.length • 1 <= n <= 2* 104 0 <= height[i]<<= 105 Output Format Print a single line containing one positive integer, denoting the maximum amount of water that can be stored. Sample Input 0 12 0 1 0 2 1 0 1 3 2 1 2 1
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Conserving water saves energy. In many regions water gets collected between the valleys which is used for
various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given
N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total
units of water it can hold after raining.
3
2
• Height = [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.
Input Format
First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights
of the valley.
Constraints
• n == = height.length
• 1 <= n <= 2 * 104
• 0 <= height[i] <= 105
Output Format
Print a single line containing one positive integer, denoting the maximum amount of water that can be stored.
Sample Input 0
12
0 1 0 2 1 0 1 3 2 1 2 1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb4cd191d-68c5-466e-ad1d-f4b8866f2b0b%2Feefc4f8d-3f1a-4bce-8a70-a9a51edb8c9b%2Fakinb2z_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Conserving water saves energy. In many regions water gets collected between the valleys which is used for
various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given
N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total
units of water it can hold after raining.
3
2
• Height = [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.
Input Format
First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights
of the valley.
Constraints
• n == = height.length
• 1 <= n <= 2 * 104
• 0 <= height[i] <= 105
Output Format
Print a single line containing one positive integer, denoting the maximum amount of water that can be stored.
Sample Input 0
12
0 1 0 2 1 0 1 3 2 1 2 1
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY