不相交集合的合并

#include <iostream>

using namespace std;

int parent[1000], a[1000];

void unionArray(int i, int j) {
    int x = parent[i] + parent[j];
    if(parent[i] > parent[j]) { // i的节点少
        parent[i] = j;
        parent[j] = x;
    } else {
        parent[j] = i;
        parent[i] = x;
    }
}

int find(int i) {
    int j = i;
    while (parent[j] > 0) {
        j = parent[j];
    }
    int k = i;
    while (parent[k] > 0) {
        int temp = parent[k];
        parent[k] = j;
        k = temp;
    }
    return j;
}

int main() {
    int size = 10;
    for (int i = 1; i < size; ++i) {
        parent[i] = -1;
    }
    unionArray(find(1), find(2));
    unionArray(find(2), find(3));
    for (int j = 1; j < size; ++j) {
        cout << parent[j] << endl;
    }
    return 0;
}