1143 Lowest Common Ancestor (30 分)

最新推荐文章于 2020-01-22 17:29:33 发布

等我学会后缀自动机

最新推荐文章于 2020-01-22 17:29:33 发布

阅读量120

点赞数

本文链接：https://blog.csdn.net/qq_37451344/article/details/100030045

版权

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=1e4+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
map<int,int> mp;
int m,n,a[maxn];
int LCA(int u,int v){
	rep(i,0,n) if(a[i]<=v&&a[i]>=u) return a[i];
}
int main(){
    scanf("%d%d",&m,&n);
    rep(i,0,n) {
		scanf("%d",&a[i]);
		mp[a[i]]=1;
	}
    rep(i,0,m){
        int x,y,f1=0,f2=0;
        scanf("%d%d",&x,&y);
        ///x=mp[x],y=mp[y];
        if(mp[x]==0) f1=1;
        if(mp[y]==0) f2=1;
        if(f1&&f2){
            printf("ERROR: %d and %d are not found.\n",x,y);
        }else if(f1){
            printf("ERROR: %d is not found.\n",x);
        }else if(f2){
            printf("ERROR: %d is not found.\n",y);
        }else{
            int ret=LCA(min(x,y),max(x,y));
            if(ret==x){
                printf("%d is an ancestor of %d.\n",x,y);
            }else if(ret==y){
                printf("%d is an ancestor of %d.\n",y,x);
            }else{
                printf("LCA of %d and %d is %d.\n",x,y,ret);
            }
        }
    }
    return 0;
}