并查集
文章平均质量分 57
Myriad_Dreamin
这个作者很懒,什么都没留下…
展开
-
[补题/研究] BUPT冬季训练Div.1 #1C: CodeForces - 699D Fix a Tree
Winter Training Div.1 #1 C题 D. Fix a Tree A tree is an undirected connected graph without cycles. 一棵树是一个无向无环的连通图。 Let’s consider a rooted undirected tree with nnn vertices, numbered 111 through nn...原创 2018-02-22 19:07:47 · 266 阅读 · 0 评论 -
HDOJ-3375 XieGang and FanXieGang(并查集)
拆点就可以轻松过了… #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int N=505; char mp[N][N]; int pre[(N*N)<<3]; int find(int x){ return x=原创 2018-10-02 20:52:13 · 284 阅读 · 1 评论