田忌赛马（几组好的测试点）

最新推荐文章于 2023-11-08 16:31:36 发布

nayix

最新推荐文章于 2023-11-08 16:31:36 发布

阅读量2.5k

点赞数 3

分类专栏：练习文章标签：贪心算法 c++ 田忌赛马

本文链接：https://blog.csdn.net/qq_16206173/article/details/88571041

版权

田忌赛马的故事被转化为一个寻找最大匹配的图论问题，特别是在二分图中。每匹马的速度决定了图的边，更快的马总是能战胜更慢的。给定双方马的速度，目标是找出赢得最多回合的策略。该问题要求编写程序解决这种特殊匹配问题，每个测试用例包含双方马的数量及其速度。输出田忌能获得的最大银两数。

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

田忌赛马（几组好的测试点）

问题描述：

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