poj1330 裸LCA
来源:互联网 发布:windows安装hadoop2.7 编辑:程序博客网 时间:2024/06/03 19:38
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.
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
2
16
1 14
8 5
10 16
5 9
4 6
8 4
4 10
1 13
6 15
10 11
6 7
10 2
16 3
8 1
16 12
16 7
5
2 3
3 4
3 1
1 5
3 5
Sample Output
4
3
题意很简单…
给一棵树,找最深的公共祖先
讲道理看着这个我一开始想出来的是先建树。。
然后赋予每个点自己的深度,让深的往上爬,爬到两个深度相同的时候看看是否在同一点,否则就一起爬直到相等位置….
太蠢了卧槽
正规的做法是让其中一个节点爬到顶,留下自己的足迹,再让另一个往上爬,爬到第一个足迹就可以停。。
我真是智商低啊
#include<iostream>#include<algorithm>#include<memory.h>using namespace std;int baba[10001];int gaga[10001];int main(){ int T; cin >> T; while (T--) { memset(gaga, 0, sizeof(gaga)); int n; cin >> n; int q, w; for (int a = 1;a <= n - 1;a++) { cin >> q >> w; baba[w] = q; } cin >> q >> w; while (q != baba[q]) { gaga[q] = 1; q = baba[q]; } while (!gaga[w])w = baba[w]; cout << w << endl; } return 0;}
- poj1330 裸LCA
- 【lca】lca转rmq poj1330
- LCA问题 poj1330 / poj1470
- poj1330 LCA离线算法
- poj1330 lca转rmq
- POJ1330(LCA-离线tarjan)
- poj1330 倍增LCA
- poj1330 LCA模板题
- [poj1330]lca最劣版
- Poj1330 LCA模板题
- poj1330+hdu2586 LCA离线算法
- poj1330 LCA 屯个模板
- 【poj】lca模板题 poj1330
- POJ1330 Nearest Common Ancestors[LCA]
- 【POJ1330】Nearest Common Ancestors(LCA)
- poj1330 lca倍增算法模板
- 【lca】lca的tarjan写法 poj1330
- lca离线算法模板(poj1330验证)
- 字符串出现的次数
- 手把手教React Native实战之44API学习-网络状态与数据交互
- 关于网络连接Network的使用
- Git - Your branch and 'origin/xxx' have diverged
- Storm中的一些概念
- poj1330 裸LCA
- 使用 JQuery 返回页面顶部
- Scala学习笔记(三) ---- 类与对象
- 用JAVA读取XML文件
- 一天一篇批处理之——part1:Batch批处理语句中echo on/off 与@ 的区别
- afxAfxBeginThread 获取线程函数返回值
- 获取当前屏幕显示的viewcontroller
- java 数据持久层的框架(完全转载)
- css3做圆形轨迹移动动画