随笔分类 - 数据结构模块

并查集 POJ 1988

摘要：#include #define N 30010int pa[N]; //parentint siz_tree[N]; //size of treeint d[N]; //dist between node and rootint Find(int x){ if(pa[x] == x) ret... 阅读全文

posted @ 2015-04-05 23:51 井_中窥月阅读(136) 评论(0) 推荐(0)