台阶储水问题

Question:

Analysis:

Solution:

#include <iostream>

int main(int argc, char **argv)
{
    int stages[] = {3, 0, 1, 2, 1, 0, 2, 3, 0, 2, 0, 2};
    int sum = 0;

    for (int i = 0; i < 12 - 1; i++)
    {
        for (int height = stages[i]; height > stages[i + 1]; height--)
        {
            for (int j = i + 1; j < 12; j++)
            {
                if (stages[j] >= height)
                {
                    sum += (j - i - 1);
                    break;
                }
            }
        }
    }

    std::cout << sum << std::endl;

    return 0;
}