uva 11292
2016-03-17 21:03
351 查看
传送门:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19048
为了节省开支,但是又想完成杀死所有恶龙的任务,我们可以采用贪心的策略:
1.将所有骑士身高排序,将所有恶龙的头按照直径排序
2.依次让当前最弱的骑士去“挑战”,当前最弱的恶龙的头,如果能够胜任,当然最好;否则,就只好换下一个更厉害的骑士了。
为了节省开支,但是又想完成杀死所有恶龙的任务,我们可以采用贪心的策略:
1.将所有骑士身高排序,将所有恶龙的头按照直径排序
2.依次让当前最弱的骑士去“挑战”,当前最弱的恶龙的头,如果能够胜任,当然最好;否则,就只好换下一个更厉害的骑士了。
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?