ChasingTheFreeWind

class Solution { public: map<int,int> father; int Find(int x) { int r = x; while(father[r]!=r) r = father[r]; int i = x; int j; while(father[i]!=i) { j = father[i]; .

并查集 思路 并查集，遍历数组，如果该数字+1在数组中则将它们合并。 代码 class Solution { unordered_map<int,int> father,cnt; int Find(int x) { int r = x; while(r!=father[r]) { r = father[r]; } int i = x; int j; .

简单题，写出并查集就完事。 #include <iostream> #include <cstring> #include <cstdio> #include <set> #define MAX 10100 using namespace std; int N,Q; int father[MAX]; set<int> birds; in...