Greedy distribution problem (2)

A daily topic ing, Today is a day hard topic Power button 135. Candy

class Solution {
    
public:
    int candy(vector<int>& ratings) {
    
        int min=0;
        vector<int> mark;
        for(int i=0;i<ratings.size();i++)
        {
    
            mark.push_back(1);
        }
        for(int i=ratings.size()-2;i>=0;i--)
        {
    
            if(ratings[i]>ratings[i+1])
            {
    
                mark[i]=mark[i+1]+1;
            }
        }
        for(int i=1;i<=ratings.size()-1;i++)
        {
    
            if(ratings[i]>ratings[i-1])
            {
    
                mark[i]=mark[i]>mark[i-1]+1?mark[i]:mark[i-1]+1;
            }
        }
        for(int i=0;i<=ratings.size()-1;i++)
        {
    
            min=min+mark[i];
        }
        return min;
    }
};