【杭电OJ】--1052-田忌赛马（贪心，双端队列）

最新推荐文章于 2023-08-09 00:06:37 发布

promise_yaner

最新推荐文章于 2023-08-09 00:06:37 发布

阅读量1.6k

点赞数 2

分类专栏：栈与队列文章标签： c语言

本文链接：https://blog.csdn.net/Greenary/article/details/55107592

版权

本文详细介绍了杭电在线评测系统（OJ）中的一道题目——1052田忌赛马问题。通过使用贪心策略和双端队列，来解决如何在三局两胜的赛马比赛中赢得比赛的策略。该文章深入探讨了算法思想，并可能包含具体代码实现。

摘要由CSDN通过智能技术生成

U - Tian Ji -- The Horse Racing

Here is a famous story in Chinese history.

"That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."

"Both of Tian and the king have three horses in different classes, namely, regular, plus, and super. The rule is to have three rounds in a match; each of the horses must be used in one round. The winner of a single round takes two hundred silver dollars from the loser."

"Being the most powerful man in the country, the king has so nice horses that in each class his horse is better than Tian's. As a result, each time the king takes six hundred silver dollars from Tian."

"Tian Ji was not happy about that, until he met Sun Bin, one of the most famous generals in Chinese history. Using a little trick due to Sun, Tian Ji brought home two hundred silver dollars and such a grace in the next match."

"It was a rather simple trick. Using his regular class horse race against the super class from the king, they will certainly los