Description: N elements in the collection of application problems, we are usually at the beginning of each element to constitute a single element of the collection, and the merger of the collection belonging to the same group of elements certain order, was to be repeated to find an element in which the collection. This type of problem in recent years recurring domestic and international race title Informatics, which is characterized by a seemingly is not complicated, but the amount of data, normal data structures described, often in the space is too large , the computer can not afford narrowly passed even in space, running time complexity is also very high, simply impossible questions need to calculate the results of the competition provisions of the running time (1-3 seconds), only a new abstract special data structure- and check set to describe.
To Search:
File list (Check if you may need any files):
Union-find.dev
sh9.cpp
Download