并查集
文章平均质量分 83
hzasrd
这个作者很懒,什么都没留下…
展开
-
poj 1703 Find them, Catch them(种类并查集)
The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which g原创 2017-08-22 16:02:19 · 200 阅读 · 0 评论 -
lightoj 1009 Back to Underworld (种类并查集)
The Vampires and Lykans are fighting each other to death. The war has become so fierce that, none knows who will win. The humans want to know who will survive finally. But humans are afraid of going t原创 2017-08-22 15:58:40 · 251 阅读 · 0 评论 -
hihoCoder 1515 分数调查(带权并查集)
时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi的学校总共有N名学生,编号1-N。学校刚刚进行了一场全校的古诗文水平测验。 学校没有公布测验的成绩,所以小Hi只能得到一些小道消息,例如X号同学的分数比Y号同学的分数高S分。 小Hi想知道利用这些消息,能不能判断出某两位同学之间的分数高低? 输入第一行包含三个整数N,原创 2017-08-22 16:06:54 · 287 阅读 · 0 评论 -
算法模板之并查集
int f[N];int Find(int x){ if(x==f[x]) return x; f[x]=Find(f[x]); return f[x];}void Union(int a,int b){ int ta=Find(a); int tb=Find(b); if(ta!=tb) f[ta]=tb原创 2017-08-22 16:09:56 · 224 阅读 · 0 评论