zoukankan      html  css  js  c++  java
  • PAT 甲级 1151 LCA in a Binary Tree

    https://pintia.cn/problem-sets/994805342720868352/problems/1038430130011897856

    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.

    Given any two nodes in a binary tree, 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 binary tree, respectively. In each of the following two lines, N distinct integers are given as the inorder and preorder traversal sequences of the binary tree, respectively. It is guaranteed that the binary tree can be uniquely determined by the input sequences. 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 binary tree, 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
    7 2 3 4 6 5 1 8
    5 3 7 2 6 4 8 1
    2 6
    8 1
    7 9
    12 -3
    0 8
    99 99
    

    Sample Output:

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

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    int N, M;
    vector<int> in, pre;
    map<int, int> pos;
    
    void lca(int inl, int inr, int preroot, int a, int b) {
        if(inl > inr) return ;
        int inroot = pos[pre[preroot]], ain = pos[a], bin = pos[b];
        if(ain < inroot && bin < inroot)
            lca(inl, inroot - 1, preroot + 1, a, b);
        else if((ain > inroot && bin < inroot) || (ain < inroot && bin > inroot))
            printf("LCA of %d and %d is %d.
    ", a, b, in[inroot]);
        else if(ain > inroot && bin > inroot)
            lca(inroot + 1, inr, preroot + 1 + inroot - inl, a, b);
        else if(ain == inroot)
            printf("%d is an ancestor of %d.
    ", a, b);
        else if(bin == inroot)
            printf("%d is an ancestor of %d.
    ", b, a);
    }
    
    int main() {
        scanf("%d%d", &M, &N);
        in.resize(N + 1), pre.resize(N + 1);
        for(int i = 1; i <= N; i ++) {
            scanf("%d", &in[i]);
            pos[in[i]] = i;
        }
        for(int i = 1; i <= N; i ++)
            scanf("%d", &pre[i]);
    
        for(int i = 0; i < M; i ++) {
            int x, y;
            scanf("%d%d", &x, &y);
            if(pos[x] == 0 && pos[y] == 0)
                printf("ERROR: %d and %d are not found.
    ", x, y);
            else if(pos[x] == 0 || pos[y] == 0)
                printf("ERROR: %d is not found.
    ", pos[x] == 0 ? x : y);
            else
                lca(1, N, 1, x, y);
        }
        return 0;
    }  

    LCA 

    FHFHFH

  • 相关阅读:
    app移动测试 (自动化遍历方法和技巧)(转载大佬)
    使用Jmeter录制脚本并调试
    整理token,session ,cookies 和正则表达式整理
    ·接口测试核心:URL&HTTP协议详解
    性能测试基本概念 聚合报告指标分析
    数据分析技能点梳理
    数据分析整体知识点架构(转载)
    数据分析职业前景规划
    数据分析三年建议指导(书籍等)
    系统吞吐量(TPS)、用户并发量、性能测试概念和公式 (转载)
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10331693.html
Copyright © 2011-2022 走看看