Jason Damon

摘要： POJ1308并查集的学习#include <iostream>#include <memory.h>using namespace std;int father[5000];bool has_point[5000];int case_number;void Ini_Set(int y){ father[y]=y; has_point[y]=true;}int Find_Set(int x){ if(father[x]!=x){ //不是单独的节点 father[x]=Find_Set(father[x]); } return father[x]... 阅读全文