hdu 1856 More is better
来源:互联网 发布:2017人工智能大会 编辑:程序博客网 时间:2024/05/23 00:07
/* 题意: n组边,问这些边所组成的一个连通图 里面最多可以有多少节点, 可以用并查集建图,d[x]存储节点个数
*/
#include<cstdio>
#include<cstring>#include<algorithm>
#define M 10000001
using namespace std;
int p[M],d[M];
int find(int x)
{
return x==p[x]?x:p[x]=find(p[x]);
}
int Union(int x,int y)
{
int px=find(x);
int py=find(y);
if(px!=py)
{
p[py] = px;
d[px] += d[py];
}
}
int init()
{
for(int i = 0; i <= M; i++)
{
p[i] = i;
d[i]=1;
}
}
int main()
{
int n,a,b,r=0;
while(scanf("%d",&n)==1)
{
init();
for(int i = 0; i < n; i++)
{
scanf("%d%d",&a,&b);
r=max(r,max(a,b));
Union(a,b);
}
int num = 0,ans=0;
for(int i = 1; i <= r; i++)
{
if(p[i]==i)
{
num=max(num,d[i]);
}
}
printf("%d\n",num);
}
return 0;
}
- hdu 1856 More is better
- HDU 1856 more is better
- Hdu-1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu-1856 More is better
- Could not apply the stored configuration for monitors
- 数据库查询内外连接
- JUnit单元测试(七)--JUnit之集成模式
- __declspec(dllimport)的作用
- Win7 下配置Cocos2d
- hdu 1856 More is better
- 汇编语言王爽(第二版)课后习题答案
- 输出9*9乘法口诀表
- 标识符命名规则
- Uva - 11825 - Hackers' Crackdown(状态压缩dp)
- SQL查询超时的设置方法
- 打印出所有的“水仙花数”,所谓“水仙花数”是指一个三位数,其各位数字立方和等于该数本身。例如:153是一个“水仙花数”,因为153=1的三次方+5的三次方+3的三次方
- hdu 4544 湫湫系列故事——消灭兔子(优先队列+贪心)
- OpenMP: 程序for循环并行效率优化