prithviking98's blog

By prithviking98, history, 7 years ago, In English

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 ?

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it