Proof for a greedy solution

Revision en1, by prithviking98, 2018-06-16 15:52:36

the problem is UVa 11157 — lazy frog

i understand that the subproblem is to find the minimax jump between two closest big stones. but how to prove that alternating jumps on the small stones is the best strategy ?

Tags greedy, uva

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English prithviking98 2018-06-16 15:52:36 365 Initial revision (published)