WanDerIngcc的博客

题目：1118 Birds in Forest (25 分) 分析：并查集，和1107 social cluster很像，本题要在findFa函数中进行路径压缩，否则有一个测试点会超时，并查集还是要多练，太菜了#include <iostream>#include<cstring>#include<vector>#include<map>#include<math.h>#include<stdio.h>#include.

题目：1114 Family Property (25 分) 分析：排序+并查集，主要就是数据的查找比较麻烦一点点#include <iostream>#include<cstring>#include<vector>#include<map>#include<stdio.h>#include<math.h>#include<algorithm>using namespace std;#define M.

int findFa(int x){ if(fa[x] == x) return x; return findFa(fa[x]);}void uni(int a,int b){ fa[findFa(a)] = findFa(b);}路径压缩：只要我们在查询(findFa函数中)的过程中，把沿途的每个节点的父节点都设为根节点即可:int findFa(int x){ if(fa[x] == x) return x; fa[x] = findFa(f

题目：1107 Social Clusters (30 分) 分析：并查集的使用。#include <iostream>#include<cstring>#include<vector>#include<stdio.h>#include<algorithm>using namespace std;int n,m,k;int fa[100001];int hob[100001];int findFa(int x){ .