<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 {
public:
    void printVec(vector<int> vec) {
        for(int i=0;i<size(vec);i++)
            cout << vec[i] << " ";
        cout << endl;
    }
    int candy(vector<int>& ratings) {
        int n = size(ratings);
        vector<int> cnts(n, 1);
        vector<int> V(n);
        iota(V.begin(),V.end(),0); //Initializing
        sort( V.begin(),V.end(), [&](int i,int j){return ratings[i]<ratings[j];} );
        int cur;
        for(int i=0;i<n;i++) {
            cur = V[i];
            if(cur+1<n && ratings[cur]>ratings[cur+1])
                cnts[cur] = cnts[cur+1]+1;
            if(cur-1>=0 && ratings[cur-1]<ratings[cur])
                cnts[cur] = max(cnts[cur], cnts[cur-1]+1);
        }
        printVec(cnts);
        return accumulate(cnts.begin(), cnts.end(), 0);
    }
};
21200