Algorithms

In some cities, the sewage system does not work properly and every time it rains, water accumulates on the streets and in between buildings, blocking traffic and causing distress.

You have an N number of buildings and an array with the height of every building.

You want to find out what is the maximum volume of water that would hypothetically accumulate after heavy rain, in between 2 buildings.

Input: N > 0 on the first line, array of N integer elements on the second line.

Output: integer positive X units of water.

Example: The following sequence of heights will generate the structure below:

Sequence: 1 2 1 5 2 4 1 0 1 2 6 4 5 2 3 4 1 2

The biggest block of water would contain 20 units of water.




<pre>using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace heavy_rain{
    class Program{
        static void Main(string[] args){
            System.IO.StreamReader sr;
            int n = 0, i = 0, result = int.MaxValue;
            int[] buildingHeights = null;
            try {
                sr = new System.IO.StreamReader(args[0]);
                String[] lines = new String[2];
                String line = null;
                while ((line = sr.ReadLine()) != null) {
                    lines[i++] = line;
                }
                n = int.Parse(lines[0]);
                buildingHeights = new int[n];
                String[] heights = lines[1].Split(' ');
                for(int j = 0; j < heights.Length; j++) {
                    buildingHeights[j] = int.Parse(heights[j]);
                }
                /* YOUR CODE HERE */
                Console.WriteLine(result);
            }
            catch (Exception e) {
                System.Diagnostics.Trace.WriteLine(e.Message);
            }
        }
    }
}