Candy LeetCode solution in C++

1
class Solution {
2
 public:
3
  int candy(vector<int> &ratings) {
4
    ios_base::sync_with_stdio(false);
5
    cin.tie(NULL);
6
    int ans = 0, i;
7
    vector<int> store(ratings.size(), 1);
8
    for (i = 0; i < ratings.size() - 1; i++)
9
      if (ratings[i + 1] > ratings[i]) store[i + 1] = store[i] + 1;
10
    for (i = ratings.size() - 1; i > 0; i--)
11
      if (ratings[i - 1] > ratings[i]) store[i - 1] = max(store[i - 1], store[i] + 1);
12
    for (auto i : store) ans += i;
13
    return ans;
14
  }
15
};