卡路径压缩的并查集题目-hdu 1856
2013-04-25 22:55
375 查看
#include<cstdio> #define Max(a,b) (a)>(b)?(a):(b) int father[10000001],boy[10000001]; int maxboy; int find(int x) { int r=x,tmp; while(father[x]!=x) x=father[x]; while(r!=x) //路径压缩 { tmp=father[r]; father[r]=x; r=tmp; } return x; } void Union(int x,int y) { int fx=find(x); int fy=find(y); if(fx!=fy) { father[fx]=fy; boy[fy]+=boy[fx]; maxboy=(maxboy,boy[fy]); } } int main() { int m,i,x,y; while(scanf("%d",&m)!=EOF) { maxboy=1; for(i=0;i<=100010;i++) { father[i]=i; boy[i]=1; } for(i=1;i<=m;i++) { scanf("%d%d",&x,&y); Union(x,y); } printf("%d\n",maxboy); } return 0; }
相关文章推荐
- hdu 1856 并查集(很裸)(路径压缩)
- HDU 1856 More is better(并查集路径压缩+剪枝优化+暴力枚举)
- hdu 1856 并查集(路径压缩)
- HDU 1856 More is better 并查集 路径压缩
- HDU 3635 并查集+路径压缩+记录每个点移动次数
- HDU 3635 Dragon Balls(并查集路径压缩)
- HDOJ 1856 More is better (并查集 + 压缩路径 + 结点深度)
- HDU 3038 How Many Answers Are Wrong (并查集路径压缩)
- HDU 3038 How Many Answers Are Wrong(路径压缩并查集)
- HDU 4496D-City2013通化邀请赛D题(并查集 需要压缩路径)
- HDU 3047 Zjnu Stadium(带权并查集,路径压缩)
- HDU - 2545 树上战争(没有路径压缩的并查集)
- HDU 3635 Dragon Balls(并查集:路径压缩)
- hdu 3635 Dragon Balls ( 并查集路径压缩)
- hdu 2818 Building Block 并查集 路径压缩
- [HDU 3635]Dragon Balls[并查集][路径压缩]
- HDU 3635 Dragon Balls(并查集--路径压缩拓展应用)
- hdu 3635 Dragon Balls (并查集,路径压缩应用)
- hdu 3635 Dragon Balls (并查集,路径压缩应用)
- HDU-3635 Dragon Balls 并查集路径压缩