Fair Candy for Ratings
Children stand in a row with given ratings. Each gets at least one candy, and any child with a strictly higher rating than an immediate neighbour must get more candy than that neighbour. Print the minimum total candy.
Input: the first line has N; the second line has the N ratings.
Output: the minimum total candy.
Constraints:
- 1 ≤ N ≤ 105
- 1 ≤ rating ≤ 100
Sample Tests
Input 1
3 1 2 2
Output 1
4
Input 2
4 1 3 2 1
Output 2
7
Discussion (opens after you solve — no spoilers before)
No comments yet.