Killing them quickly, I got a date!
CodeChefOpen on judge ↗
Our hero Deadpool is attacked by enemies. There are N enemies standing in a line(their positions are fixed). Each of the enemy has a strength value. Deadpool needs to finish all the enemies to be safe. Every enemy should be attacked with a power of value atleast one (only integer values). For every two enemies at adjacent positions, the one with the higher strength value should be attacked with h
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