Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Fair Candy for Ratings

Fair Candy for Ratings

Difficulty: 1600 5000 ms 128 MB

greedy

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

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen