poj 1962 带权并查集
2011-11-28 23:43
393 查看
注意路径压缩时的权值合并
View Code
View Code
#include<cstdio> #include<cstring> #include<stdlib.h> const int MAX = 20010; int p[MAX],w[MAX]; void init(int n) { for(int i=0;i<=n;i++) { p[i]=i; w[i]=0; } } void unio(int x,int y) { p[x]=y; w[x]=(abs(x-y)%1000); } int find(int x) { if(p[x]==x) return x; else { find(p[x]);w[x]+=w[p[x]]; p[x]=find(p[x]); } } int main() { int t,n,x,y; char ch; scanf("%d",&t); while(t--) { scanf("%d",&n); init(n); getchar(); while(scanf("%c",&ch)&&ch!='O') { if(ch=='E') { scanf("%d",&x); find(x); printf("%d\n",w[x]); } else { scanf("%d%d",&x,&y); unio(x,y); } getchar(); } } return 0; }
相关文章推荐
- poj 1962 Corporative Network(并查集)
- 并查集 Corporative Network POJ 1962
- POJ1962 Corporative Network 并查集
- POJ - 1962 Corporative Network(带权并查集)
- poj 1962 Corporative Network 并查集的应用
- POJ1962 - Corporative Network - 并查集
- POJ 1962/ ZOJ 2178: Corporative Network - 并查集
- 并查集 Poj 1838 + 1611 + 1962 + Zoj 2833
- poj 1962 Corporative Network 并查集,很容易超时,大家要注意合并
- POJ1962:Corporative Network(并查集)
- poj 1962 带路径的并查集
- poj1962 Corporative Network(带权并查集)
- poj 1962 Corporative Network(带权并查集)
- poj 1962 Corporative Network (并查集)
- POJ 1962-Corporative Network (并查集)
- poj Wireless Network(基础并查集)
- poj Is It A Tree?(并查集)(连通无环图)
- POJ 2524 Ubiquitous Religions【并查集入门】
- POJ 1182 食物链【经典并查集应用】
- poj 1182 食物链 (带权并查集升级版)