<p>There are <code>n</code> children standing in a line. Each child is assigned a rating value given in the integer array <code>ratings</code>.</p>

<p>You are giving candies to these children subjected to the following requirements:</p>

<ul>
	<li>Each child must have at least one candy.</li>
	<li>Children with a higher rating get more candies than their neighbors.</li>
</ul>

<p>Return <em>the minimum number of candies you need to have to distribute the candies to the children</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> ratings = [1,0,2]
<strong>Output:</strong> 5
<strong>Explanation:</strong> You can allocate to the first, second and third child with 2, 1, 2 candies respectively.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> ratings = [1,2,2]
<strong>Output:</strong> 4
<strong>Explanation:</strong> You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
The third child gets 1 candy because it satisfies the above two conditions.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == ratings.length</code></li>
	<li><code>1 &lt;= n &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>0 &lt;= ratings[i] &lt;= 2 * 10<sup>4</sup></code></li>
</ul>

class Solution {
    void rec(vector<int>& ratings, int n, int isVis[], int candies[], int& ans, int index) {
        if (isVis[index]) {
            return;
        }
        isVis[index] = 1;
        if (index > 0 && ratings[index] > ratings[index-1]) {
            candies[index] = candies[index-1] + 1;
        }
        if (index + 1 < n && ratings[index] > ratings[index+1]) {
            rec(ratings, n, isVis, candies, ans, index+1);
            candies[index] = max(candies[index], candies[index+1] + 1);
        }
        ans += candies[index];
    }

public:
    int candy(vector<int>& ratings) {
        int n = ratings.size();
        int isVis[n];
        int candies[n];
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            isVis[i] = 0;
            candies[i] = 1;
        }
        for (int i = 0; i < n; ++i) {
            if (isVis[i] == 0) {
                rec(ratings, n, isVis, candies, ans, i);
            }
        }
        return ans;
    }
};
21600