1143深刻理解LCA

#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
map<int,bool> mp;
int pre[100010];
int main()
{
	int m,n,u,v,a;
	scanf("%d %d",&m,&n);
	for(int i = 0; i < n; i++){
		scanf("%d",&pre[i]);
		mp[pre[i]] = true;
	}
	for(int i = 0; i < m; i++)
	{
		scanf("%d %d",&u,&v);
		for(int j = 0; j < n; j++)
		{
			a = pre[j];
			if((u >= a && v <= a)||(u <= a && v >= a)){
				break;
			}
		}
		if(mp[u] == false && mp[v] == false) printf("ERROR: %d and %d are not found.\n",u,v);
		else if(mp[u] == false || mp[v] == false) printf("ERROR: %d is not found.\n",mp[u] == false? u:v);
		else if(a == u||a == v)printf("%d is an ancestor of %d.\n",a,a==u?v:u);
		else printf("LCA of %d and %d is %d.\n",u,v,a);
			
	}
	system("pause");
	return 0;
}#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
map<int,bool> mp;
int pre[100010];
int main()
{
	int m,n,u,v,a;
	scanf("%d %d",&m,&n);
	for(int i = 0; i < n; i++){
		scanf("%d",&pre[i]);
		mp[pre[i]] = true;
	}
	for(int i = 0; i < m; i++)
	{
		scanf("%d %d",&u,&v);
		for(int j = 0; j < n; j++)
		{
			a = pre[j];
			if((u >= a && v <= a)||(u <= a && v >= a)){
				break;
			}
		}
		if(mp[u] == false && mp[v] == false) printf("ERROR: %d and %d are not found.\n",u,v);
		else if(mp[u] == false || mp[v] == false) printf("ERROR: %d is not found.\n",mp[u] == false? u:v);
		else if(a == u||a == v)printf("%d is an ancestor of %d.\n",a,a==u?v:u);
		else printf("LCA of %d and %d is %d.\n",u,v,a);
			
	}
	system("pause");
	return 0;
}