leetcode - Candy

class Solution {
public:
int candy(std::vector<int> &ratings) {
std::vector<int> ans(ratings.size(),0);
ans[0] = 1;
int sz = ratings.size();
for (int i = 1; i < sz; i++)
{
if(ratings[i-1] < ratings[i])
{
ans[i] = ans[i-1] + 1;
}
else
{
ans[i] = 1;
}
}
for(int i = sz - 2; i >= 0; i--)
{
if(ratings[i+1] < ratings[i])
{
int t = ans[i+1] + 1;
ans[i] = t > ans[i] ? t : ans[i];
}
}
int s = 0;
for (int i = 0; i < sz; i++)
{
s += ans[i];
}
return s;
}
};