问题:n个选手参加比赛,每个选手与其他选手进行单循环比赛,每个选手一天至多进行一场,循环赛在n-1天内要结束
使用分治法的思想,将问题分解为上半区选手,下半区选手,每个半区一半的人,首先进行半区与半区之间的比赛
然后是半区内部的比赛
这样程序就可以使用递归
假如n=2k,那么比赛将在2k-1+2k-2+...+1=2k-1=n-1天完成
假如n在分解的过程中有奇数出现,而且奇数出现的比较多,会多出来几天
程序如下:
void
ArrangeSchedule(
const
vector
<
int
>&
player,
int
day)
![](https://i-blog.csdnimg.cn/blog_migrate/a41954a27d6ad96fa2c2cf816e677448.gif)
...
{
if(player.size()<=1)
return;
else
![](https://i-blog.csdnimg.cn/blog_migrate/37c8bf68cdc3cc81759c34160776bc53.gif)
...{
int half_sz=player.size()/2;
int remain_sz=player.size()-half_sz;
vector<int> upper_half(player.begin(),player.begin()+half_sz);
vector<int> lower_half(player.begin()+half_sz,player.end());
int intra_start_day=InterGame(upper_half,lower_half,day);
ArrangeSchedule(upper_half,intra_start_day);
ArrangeSchedule(lower_half,intra_start_day);
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/6810355c2f78c12e91b7997a8e8c583a.gif)
int
InterGame(
const
vector
<
int
>&
p1,
const
vector
<
int
>&
p2,
int
day)
![](https://i-blog.csdnimg.cn/blog_migrate/a41954a27d6ad96fa2c2cf816e677448.gif)
...
{
int max_day=(p1.size()>=p2.size())?p1.size():p2.size();
if(p1.size()<=p2.size())
![](https://i-blog.csdnimg.cn/blog_migrate/37c8bf68cdc3cc81759c34160776bc53.gif)
...{
for(int i=0;i<p2.size();i++)
![](https://i-blog.csdnimg.cn/blog_migrate/37c8bf68cdc3cc81759c34160776bc53.gif)
...{
for(int index_team=0;index_team<p1.size();index_team++)
![](https://i-blog.csdnimg.cn/blog_migrate/37c8bf68cdc3cc81759c34160776bc53.gif)
...{
int verse_team=index_team+i;
if(verse_team>=p2.size())
verse_team-=p2.size();
std::cout<<"Day "<<day+i<<":Match "<<p1[index_team]<<" VS "<<p2[verse_team]<<std::endl;
}
}
}
return max_day+day;
}
参考资料:http://algorithm.diy.myrice.com/problems/index.html?by_strategy/divide_and_conquer.htm