poj2524
2013-08-06 18:25
295 查看
说来惭愧啊。。现在才会并查集。我竟然给我妈妈讲明白并查集怎么回事了- -
#define _CRT_SECURE_NO_WARNINGS #include <iostream> using namespace std; #define maxx 50010 int set[maxx]; int find(int x) { return x == set[x] ? x : (set[x] = find(set[x])); } int main() { int n, m; int kase = 0; while (cin >> n >> m && (n || m)) { for (int i = 1; i <= n; i++) { set[i] = i; } for (int i = 0; i < m; i++) { int a, b; scanf("%d %d", &a, &b); int c = find(a), d = find(b); if (c != d){ set[c] = d; } } int cnt = 0; for (int i = 1; i <= n; i++) { if (set[i] == i) cnt++; } cout << "Case " << ++kase << ": " << cnt << endl; } }
相关文章推荐
- 并查集入门题集 POJ1611 POJ1703 POJ2524 POJ1182
- POJ2524(简单并查集)
- 并查集-poj2524-Ubiquitous Religions
- POJ2524 并查集
- poj2524
- POJ2524-宗教问题-并查集-ACM
- 第四周周赛——我查,我查,我查查查题解(来自poj2524,1664,1182,HDU1021,5524,5645)
- 【poj2524】Ubiquitous Religions 【Alberta Collegiate Programming Contest 2003.10.18】
- POJ2524_并查集
- POJ2524-宗教问题-并查集-ACM
- POJ2524:Ubiquitous Religions (并查集模板)
- 并查集入门题 hd1232 poj2524 hd1233 hd1213
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions(并查集求组数)
- poj2524--Ubiquitous Religions
- poj2524
- [poj2524]Ubiquitous Religions
- POJ2524(并查集)
- poj2524 Ubiquitous Religions
- poj2524 并查集