1143 Lowest Common Ancestor (30 分)

感觉自己就是个bug

于 2021-02-23 12:52:05 发布

阅读量59

点赞数

分类专栏： pat甲级树

本文链接：https://blog.csdn.net/shshbdhsjjd/article/details/113982728

版权

pat甲级同时被 2 个专栏收录

181 篇文章 1 订阅

订阅专栏

树

37 篇文章 0 订阅

订阅专栏

该程序实现了一个二叉搜索树中查找两个节点的最近公共祖先（Lowest Common Ancestor, LCA）。输入包含多组测试用例，每组用例包括树的节点数和键的数量，随后给出树的前序遍历序列。对于每一对给定的节点，程序会输出它们的LCA，如果节点不在树中则输出错误信息。提供的代码通过遍历预序遍历序列找到LCA节点。

摘要由CSDN通过智能技术生成

1143 Lowest Common Ancestor (30 分)

The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.

A binary search tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
Given any two nodes in a BST, you are supposed to find their LCA.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 1,000), the number of pairs of nodes to be tested; and N (≤ 10,000), the number of keys in the BST, respectively. In the second line, N distinct integers are given as the preorder traversal sequence of the BST. Then M lines follow, each contains a pair of integer keys U and V. All the keys are in the range of int.

Output Specification:

For each given pair of U and V, print in a line LCA of U and V is A. if the LCA is found and A is the key. But if A is one of U and V, print X is an ancestor of Y. where X is A and Y is the other node. If U or V is not found in the BST, print in a line ERROR: U is not found. or ERROR: V is not found. or ERROR: U and V are not found…

Sample Input:

6 8
6 3 1 2 5 4 8 7
2 5
8 7
1 9
12 -3
0 8
99 99

Sample Output:

LCA of 2 and 5 is 3.
8 is an ancestor of 7.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.

和1151类似，但更加水一些

#include<bits/stdc++.h>
using namespace std;

vector<int> in, pre;
unordered_map<int, int> pos;
int main() {
	int m, n, a, b;
	scanf("%d %d", &m, &n);
	pre.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &pre[i]);
		pos[pre[i]] = i;
	}
	for (int i = 0; i < m; i++) {
		scanf("%d %d", &a, &b);
		int v;
		for (int j = 1; j <= n; j++) {
			v = pre[j];
			if ((v >= a && v <= b) || (v <= a && v >= b)) break;
		}
		if (pos[a] == 0 && pos[b] == 0) {
			printf("ERROR: %d and %d are not found.\n", a, b);
		} else if (pos[a] == 0 || pos[b] == 0) {
			printf("ERROR: %d is not found.\n", pos[a] == 0 ? a : b);
		} else if (v != a && v != b) {
			printf("LCA of %d and %d is %d.\n", a, b, v);
		} else if (v == a) {
			printf("%d is an ancestor of %d.\n", a, b);
		} else if (v == b) {
			printf("%d is an ancestor of %d.\n", b, a);
		}
	}
	return 0;
}