分糖果

https://blog.csdn.net/sinat_35261315/article/details/79170537

#include <iostream>
#include <cstdio>
#include <vector>
#include<numeric>
using namespace std;

int candy(vector<int>& ratings) {
        if(ratings.empty()) return 0;
        int n = ratings.size();
        /* 每个孩子至少分得一个糖果 */
        vector<int> candies(n, 1);
        /* 首先保证比左边的低等级的孩子分得的糖果多1 */
        for(int i = 1; i < n; ++i)
            candies[i] = (ratings[i] > ratings[i - 1]) ? candies[i - 1] + 1 : candies[i];
        /* 然后保证比右边的多，这里需要比较本身的糖果数和右边糖果数+1的大小，选择最大的 */
        for(int i = n - 2; i >= 0; --i)
            candies[i] = (ratings[i] > ratings[i + 1]) ? std::max(candies[i], candies[i + 1] + 1) : candies[i];
        /* 求和 */
        return std::accumulate(candies.begin(), candies.end(), 0);
    }

int main(void)
{
    int n;
    cin >> n;
    vector<int> ans;
    int score;
    for(int i = 0; i < n; ++i)
    {
        cin >> score;
        ans.push_back(score);
    }
    cout << candy(ans) << endl;    
    return 0;
}