Candy
Hard
Greedy
Children stand in a line with ratings. Every child gets at least one candy and a child with a higher rating than a neighbour gets more candy than that neighbour. Print the minimum total number of candies.
Constraints
1 <= n <= 2 * 10^4 0 <= rating <= 2 * 10^4
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.