/*=====================================================================================
# COPYRIGHT NOTICE
# Copyright (c) 2016
#
# @Author :Zehao Wang
# @Email :zehaowang@163.com
# @from :https://pta.patest.cn/pta/test/1342/exam/4/question/21732
# @Last modified :2016-12-05
# @Description :05-树9 File Transfer
========================================================================================*/
#include <stdio.h>
int pre[10000];
int Find(int x)
{
int i = x;
while (pre[i] != -1)
i = pre[i];
//循环执行完就找到了x的根节点的数组下标i
int j = x;
int k;
while (j != i)
{
k = pre[j];
pre[j] = i;
j = k;
}
//压缩路径
return i;
}
void unions(int x, int y)
{
int fx = Find(x);//x的根
int fy = Find(y);//y的根
if (fx != fy)
pre[fx] = fy;
}
int main(void)
{
int N;
scanf("%d", &N);
for (int i = 0; i <= N; i++)
pre[i] = -1;
char ch;
int a, b;
int count=N;
do
{
scanf("%c", &ch);
switch (ch)
{
case'C':
scanf("%d %d", &a, &b);
if (Find(a) == Find(b))
printf("yes\n");
else
printf("no\n");
break;
case'I':
scanf("%d %d", &a, &b);
unions(a, b);
count--;
break;
case'S':
break;
}
} while (ch != 'S');
if (count == 1)
printf("The network is connected.\n");
else
printf("There are %d components.\n", count);
}
/*============================================================================================
注:此题考察并查集。最开始看书看的一头雾水,后来在网上看了一篇讲解并查集的博客之后恍然大悟,发现
课本上的方式其实并不好。几乎网上所有的解题方法都没有使用书本上的这种数据结构。故不推荐看书。
博客链接:http://blog.csdn.net/dellaserss/article/details/7724401/ (不懂并查集的一定要看)
并查集其实是一种树状的数据结构,它用数组表示,数组下标即为节点编号,数组中存储的内容为该节点的
父节点。一个并查集的实现由一个数组加两个函数构成。这两个函数实现起来也十分简便,分别是寻找根节点
以及将两个集合合并。详细介绍都在博文当中,不做赘述。
==============================================================================================*/
05-树9 File Transfer
最新推荐文章于 2022-05-22 18:49:50 发布