读不懂的流年

所谓并查集，它是一个集合，这个集合的元素也是集合，他支持三种操作： MakeSet(x)，建立一个只有一个元素x的集合X0，将这个集合放入并查集中； FindSet(x)，在并查集中寻找一个元素S（注意并查集的元素S也是集合） ，满足 x属于S； Union(x,y)， 将并查集中的元素S1,S2合并，其中x属于S1，y属于S2。 下面说说并查集的实现，其实很简单，用树来实现。所有属于

hdu 1213 How Many Tables Problem Description Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You

Friendship A friend is like a flower, a rose to be exact, Or maybe like a brand new gate that never comes unlatched. A friend is like an owl, both b

More is better     Problem Description Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the b