本文档介绍了一个算法问题，即如何在不同的专家排名中找到篮球队伍的中位数排名。中位数排名是通过计算所有排名之间的距离总和最小的排名，该距离基于不同相对顺序的团队对数。例如，对于排名ACDBE和ABCDE，距离为2。给定几个投票者的排名后，需要找到具有最小总距离的中位数排名。在示例中，ABCDE是中位数排名，具有最小的总距离值4。
Problem Description
It’s preseason and the local newspaper wants to publish a preseason ranking of the teams in the local amateur basketball league. The teams are the Ants, the Buckets, the Cats, the Dribblers, and the Elephants. When Scoop McGee, sports editor of the paper, gets the rankings from the selected local experts down at the hardware store, he’s dismayed to find that there doesn’t appear to be total agreement and so he’s wondering what ranking to publish that would most accurately reflect the rankings he got from the experts. He’s found that finding the median ranking from among all possible rankings is one way to go.
The median ranking is computed as follows: Given any two rankings, for instance ACDBE a
订阅专栏 解锁全文
扫一扫
2018
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
