zoj1789-The Suspects
2012-11-12 18:24
776 查看
#include<iostream> using namespace std; int father[30001]; int fine(int x) { int j,r=x; while(father[r]>0) r=father[r]; while(r!=x) { j=father[x]; father[x]=r; x=j; } return r; } void weightmerge(int x,int y)//只用折叠时间为280//折叠压缩一起用260 { int temp; int ix,iy; ix=fine(x); iy=fine(y); temp=father[ix]+father[iy]; if(ix!=iy) if(father[ix]>father[iy])//ix的结点少,以结点多的为父节点 { father[iy]=temp; father[ix]=iy;//iy为父指针 } else { father[ix]=temp; father[iy]=ix;//ix为父指针 } } int main() { int n,m; while(1) { cin>>n>>m; if(n==0&&m==0) break; for(int i=0;i<n;i++) { father[i]=-1; } while(m--) { int re1,re2,mem; bool flag=false; cin>>mem; while(mem--) { cin>>re1; if(!flag) { re2=re1; flag=true; } else weightmerge(re1,re2); } } cout<<-father[fine(0)]<<endl; } return 0; }
相关文章推荐
- ZOJ 1789 The Suspects
- ZOJ 1789 The Suspects
- zoj 1789 The Suspects
- zoj 1789 The Suspects
- zoj - 1789 - The Suspects
- ZOJ1789(The Suspects)j简单并查集
- zoj - 1789 - The Suspects
- zoj The Suspects 并查集
- POJ 1611 / ZOJ 1789: The Suspects - 并查集
- zoj 3228 Searching the String
- poj The Suspects(并查集)
- ZOJ Design the city LCA转RMQ
- 【ZOJ】3299 Fall the Brick 线段树
- [ZOJ] 1610 - Count the Colors - 线段树
- ZOJ 2277 The Gate to Freedom
- ZOJ 3534 Move the Mouse I (ZOJ Monthly, September 2011 F题)
- ZOJ3229 Shoot the Bullet
- 动态规划-最大子矩阵和(ZOJ 1074 TO THE MAX )
- POJ1611--The Suspects--并查集裸题
- zoj 3229 Shoot the Bullet