数据结构 并查集+路径压缩+重量权衡规则

题目：使用重量权衡合并规则和路径压缩对数据进行归并，并且给出父亲指针表示法数组。

 

#include <stdio.h>  
#include <string.h>  
#include <iostream>  
#include <algorithm>
#include <math.h>
#include <map> 
#include <vector> 
#define PI acos(-1)
#define INF 1e18
#define inf 1e9
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define Si(i) scanf("%d",&i)
#define Pi(i) printf("%d\n",i);
#define ElemType int 
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const int _max = 1e5+50;
const ll mod = 1e9+7;
int father[_max];
int size[_max];
void init(int n){
	for(int i = 0 ; i < n ; i++){
		father[i] = i;
		size[i] = 1;
	}
	return ;
}
inline int find(int x){
	if(x != father[x])
		father[x] = find(father[x]);
	return father[x];
}
inline void Union(int a,int b){
	int temp_a = find(a);
	int temp_b = find(b);
	if(temp_a != temp_b){
		 
		if(size[temp_a] > size[temp_b]){
			father[temp_b] = father[temp_a];
			size[temp_b] += size[temp_a];
		}	
		else if(size[temp_a] < size[temp_b]){
			father[temp_a] = father[temp_b];
			size[temp_a] += size[temp_b];
		}
		else if(temp_a > temp[b]){
			father[temp_b] = father[temp_a];
			size[temp_b] += size[temp_a];
		}
		else{
			father[temp_a] = father[temp_b];
			size[temp_a] += size[temp_b];
		}
	}
}
int main(){
	init(20);
	int u,v;
	while(cin>>u>>v){
		if(u == -1 && v == -1) break;
		Union(u,v);
	}
	for(int i = 0 ; i < 15 ; i++)
		cout<<father[i]<<' ';
	cout<<endl;
	return 0;
}