本文讲述了中国历史上的著名故事——田忌赛马，通过贪心策略改变比赛结果。田忌用他的普通马对战齐王的上等马必输，但他的中等马能战胜齐王的普通马，上等马能战胜齐王的中等马。这个问题可以简化为寻找二分图的最大匹配，而特殊情况下，当速度决定胜负时，贪心算法就能解决。程序要求是编写一个程序来解决这种特殊匹配问题，输出田忌最多能赢得的银两数。
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 s
最低0.47元/天 解锁文章
1233
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
