Chef goes on a Tour
CodeChefOpen on judge ↗
Chef has decided to go on a tour of the city of Chefland. The Chef has fans across the city and he intends to meet as many fans as he can on his tour. The chef’s manager has made a list $stops$, of $N$ **number of stops**. The $i$-th stop in the list denotes the number of fans that Chef can meet at that stop. The chef can **only go from $stops[i]$ to $stops[i+1]$ and cannot skip any stops in betwe
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start