My_day_Hyt的博客

#include <iostream> #include<stdio.h> #include<string.h> using namespace std; const int maxn = 10010; int t,n; int x,y; int father[maxn],bj[maxn]; void bl(int n) { while(n !=father[n]) {

## 并查集小结(一) ## POJ 1703 Description The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the po