135. Candy

class Solution {
public:
    int candy(vector<int>& ratings) {
        int rsize=ratings.size();
        if(rsize<=1)
            return rsize;
        vector<int> num(rsize,1);
        for(int i=0;i<num.size()-1;i++)
        {
            if(ratings[i+1]>ratings[i])
                num[i+1]=num[i]+1;
        }
        for(int i=num.size()-1;i>0;i--)
        {
            if(ratings[i-1]>ratings[i])
                num[i-1]=max(num[i]+1,num[i-1]);
        }
        int result=0;
        for(int i=0;i<num.size();i++)
        {
            result+=num[i];
        }
        return result;
    }
};