POJ 1330
来源:互联网 发布:知乎怎么回复他人评论 编辑:程序博客网 时间:2024/05/16 15:28
Nearest Common Ancestors
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25228 Accepted: 13119
Description
A rooted tree is a well-known data structure in computer science and engineering. An example is shown below:
In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an ancestor of node 16. As a matter of fact, nodes 8, 4, 10, and 16 are the ancestors of node 16. Remember that a node is an ancestor of itself. Nodes 8, 4, 6, and 7 are the ancestors of node 7. A node x is called a common ancestor of two different nodes y and z if node x is an ancestor of node y and an ancestor of node z. Thus, nodes 8 and 4 are the common ancestors of nodes 16 and 7. A node x is called the nearest common ancestor of nodes y and z if x is a common ancestor of y and z and nearest to y and z among their common ancestors. Hence, the nearest common ancestor of nodes 16 and 7 is node 4. Node 4 is nearer to nodes 16 and 7 than node 8 is.
For other examples, the nearest common ancestor of nodes 2 and 3 is node 10, the nearest common ancestor of nodes 6 and 13 is node 8, and the nearest common ancestor of nodes 4 and 12 is node 4. In the last example, if y is an ancestor of z, then the nearest common ancestor of y and z is y.
Write a program that finds the nearest common ancestor of two distinct nodes in a tree.
In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an ancestor of node 16. As a matter of fact, nodes 8, 4, 10, and 16 are the ancestors of node 16. Remember that a node is an ancestor of itself. Nodes 8, 4, 6, and 7 are the ancestors of node 7. A node x is called a common ancestor of two different nodes y and z if node x is an ancestor of node y and an ancestor of node z. Thus, nodes 8 and 4 are the common ancestors of nodes 16 and 7. A node x is called the nearest common ancestor of nodes y and z if x is a common ancestor of y and z and nearest to y and z among their common ancestors. Hence, the nearest common ancestor of nodes 16 and 7 is node 4. Node 4 is nearer to nodes 16 and 7 than node 8 is.
For other examples, the nearest common ancestor of nodes 2 and 3 is node 10, the nearest common ancestor of nodes 6 and 13 is node 8, and the nearest common ancestor of nodes 4 and 12 is node 4. In the last example, if y is an ancestor of z, then the nearest common ancestor of y and z is y.
Write a program that finds the nearest common ancestor of two distinct nodes in a tree.
Input
The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case starts with a line containing an integer N , the number of nodes in a tree, 2<=N<=10,000. The nodes are labeled with integers 1, 2,..., N. Each of the next N -1 lines contains a pair of integers that represent an edge --the first integer is the parent node of the second integer. Note that a tree with N nodes has exactly N - 1 edges. The last line of each test case contains two distinct integers whose nearest common ancestor is to be computed.
Output
Print exactly one line for each test case. The line should contain the integer that is the nearest common ancestor.
Sample Input
2161 148 510 165 94 68 44 101 136 1510 116 710 216 38 116 1216 752 33 43 11 53 5
Sample Output
43
每个点的儿子有多个,但父亲只有一个,利用根节点没有父亲递归求解最先遇到的根节点
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int N = 100000;struct node{ int father, vis;}p[N];void LCA(int l,int r);int main(){ int t; scanf("%d", &t); while(t--) { int n; scanf("%d", &n); memset(p,0,sizeof(p)); for(int i=1;i<=n;i++) { p[i].father=i; } n--; while(n--) { int x, y; scanf("%d %d", &x, &y); p[y].father=x; } int l, r; scanf("%d %d", &l, &r); LCA(l,r); } return 0;}void LCA(int l,int r){ p[l].vis=1; while(p[l].father!=l) { p[l].vis=1; l=p[l].father; } while(p[r].father!=r) { if(p[r].vis==1) { break; } r=p[r].father; } printf("%d\n",r); return ;}
0 0
- poj 1330
- poj 1330
- poj-1330
- poj 1330
- poj 1330
- poj 1330
- POJ 1330
- POJ 1330 LCA问题
- POJ 水题 1330 LCA
- poj 1330 LCA
- poj 1330(LCA)
- Poj 1330 LCA
- poj 1330 LCA
- POJ 1330 解题报告
- (LCA倍增) poj 1330
- poj 1330 dfs树
- [LCA] POJ 1330
- POJ
- javascript注释规范
- ios的apple应用内支付 接入app
- 常用角点检测与角点匹配方法比较
- 100天土鸡饲养计划(10)
- Android部分机制的构架分析之一--Handler和Looper分析
- POJ 1330
- struct和typedef struct的理解
- nyoj 58 最小步数问题 BFS
- UML类与类之间的关系
- MySQL客户端输出窗口显示中文乱码问题解决办法
- .NET简谈事务、分布式事务处理
- struts2中constant参数设置
- 湖南省第八届省赛 kingdoms (生成树+枚举)
- ubuntu server 开机自动运行程序