【PAT】1151 LCA in a Binary Tree (30 分)

#include <iostream>
#include <vector>
#include <map>
using namespace std;

map<int,int> pos;
vector<int> in,pre;//可以直接用题中的序号作为下标,就不用建结点了

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);//在左子树中找,注意左子树根:preRoot+1
    }else if(aIn>inRoot && bIn>inRoot){//都在右子树
        lca(inRoot+1,inr,preRoot+(inRoot-inl+1),a,b);//在右子树中找,注意右子树根:preRoot+numLeft+1
    }else if((aIn>inRoot && bIn<inRoot)||(aIn<inRoot && bIn>inRoot)){//在两边
        printf("LCA of %d and %d is %d.\n",a,b,in[inRoot]);
    }else if(aIn == inRoot){
        printf("%d is an ancestor of %d.\n", a, b);
    }else if(bIn == inRoot){
        printf("%d is an ancestor of %d.\n", b, a);
    }
}

int main(){
    int m,n,a,b;
    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++){
        scanf("%d %d",&a,&b);
        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{
            lca(1,n,1,a,b);
        }
    }

    return 0;
}