More is better
来源:互联网 发布:java 局域网聊天室 编辑:程序博客网 时间:2024/06/03 18:06
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
41 23 45 61 641 23 45 67 8
42HintA and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result.In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.
这是一个有关并查集的题目。只不过不是求有几个集合,而是求每个集合中元素的个数,进而求出个数的最大值。和求集合个数的方法差不多,只需要在合并两个集合时处理一下,让这两个集合的元素个数也合并一下就行了。接下来只需要找出最大值即可。要注意的一个地方就是:当n=0时,要输出1。
#include<stdio.h>
#define N 10000000
int father[N],num[N];
void initial()/*初始化*/
{
int i;
for(i=1;i<=N;i++)
{
father[i]=i;
num[i]=1;/*开始时数量都为1,根节点为自己*/
}
}
int find(int x) /*寻找根节点*/
{
if(father[x]!=x)
father[x]=find(father[x]);
return father[x];
}
void merge(int a,int b)/*合并a和b*/
{
int p=find(a);
int q=find(b);
if(p!=q)
{
father[p]=q;
num[q]+=num[p];/*合并集合中元素个数*/
}
}
int main()
{
int n,a,b,i,sum,max;
while(~scanf("%d",&n))
{
if(n==0)
{
printf("1\n");
continue;
}
max=0;
initial(); /*初始化*/
for(i=0;i<n;i++)
{
scanf("%d%d",&a,&b);
if(a>max)
max=a;
if(b>max)
max=b;
merge(a,b); /*合并集合*/
}
int Max=0;
for(i=1;i<=max;i++)
if(num[i]>Max) /*查找最大值*/
Max=num[i];
printf("%d\n",Max);
}
return 0;
}
- HDOJ More is better
- hdu More is better
- More is better
- HDU1856:More is better
- HDU1856--More is better
- hdu1856-More is better
- HDU1856:More is better
- hdu1856 More is better
- H - More is better
- More is better
- More is better
- More is better
- More is better
- C - More is better
- hdu1856 More is better
- More is better
- More is better 1856
- 2130:More is better
- Linux下使用system()函数一定要谨慎
- 适合自己的Git工作流
- awk-基本语法知识
- Java泛型详解
- RasEnumConnections
- More is better
- 数组基本认识
- 3*3*3魔方旋转算法
- vijos 1131 枚举
- 快速理解Docker - 容器级虚拟化解决方案
- 获取视图的部分视图
- Java类的初始化顺序
- 淘忆项目之忘记密码界面的修正归纳
- Spring AOP实践(一)动态代理和静态代理,为什么使用AOP