pku 1330 LCA
2010-05-26 22:09
316 查看
第一道LCA
#include<stdio.h> #include<string.h> #define N 10001 int unionset ,visit ; int main() { int T,n,a,b,i; scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=1;i<=n;i++) //init it { unionset[i]=i; visit[i]=0; } for(i=1;i<n;i++) { scanf("%d%d",&a,&b); unionset[b]=a; } scanf("%d%d",&a,&b); /*find the root*/ visit[a]=1; a=unionset[a]; while(a!=unionset[a]) { a=unionset[a]; visit[a]=1; } while(b!=unionset[b]) { if(visit[b]) break; b=unionset[b]; } printf("%d\n",b); } return 0; }
相关文章推荐
- [PKU 1330]Nearest Common Ancestors(LCA)
- pku1330 LCA问题
- POJ 1330 Nearest Common Ancestors LCA
- POJ 1330 Nearest Common Ancestors (LCA&Tarjan算法)
- POJ 1330 Nearest Common Ancestors Tarjan求LCA
- LCA问题 poj1330 / poj1470
- POJ 1330(Nearest Common Ancestors-Lca模板题)
- LCA 最近公共祖先 [POJ 1330]
- POJ 1330 Nearest Common Ancestors (LCA)
- poj 1330 Nearest Common Ancestors (LCA) tarjan离线算法
- POJ 1330 LCA入门题(Tarjan)
- POJ1330(LCA-离线tarjan)
- [poj1330]lca最劣版
- POJ 1330 Nearest Common Ancestors(LCA)
- poj1330,JDOJ3055部分分LCA(n^2暴力算法)
- [置顶] Nearest Common Ancestors(POJ-1330)(LCA转RMQ在线算法)
- POJ1330:Nearest Common Ancestors(LCA + Tarjan离线处理)
- [LCA模板]POJ1330 Nearest Common Ancestors
- 【POJ】1330 Nearest Common Ancestors ——最近公共祖先(LCA)
- Nearest Common Ancestors - POJ 1330 LCA