#include <iostream>
#include <cmath>
#include <string>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAXN  70000
long a[MAXN],b[MAXN];
int na;
bool find(long x)
{
	int start=0,end=na-1;
	while(start<=end)
	{
		int mid=(start+end)/2;
		if(x>a[mid]) start=mid+1;
		else if(x<a[mid]) end=mid-1;
		else return true;
	}
	return false;
}

int main()
{
	register int i;
	int nb;
    scanf("%d",&na);
	for(i=0;i<na;i++)
		scanf("%d",a+i);
	scanf("%d",&nb);
	for(i=0;i<nb;i++)
		scanf("%d",b+i);
	for(i=0;i<nb;i++)
		if(find(10000-b[i]))
		{
			printf("YES\n");
			goto elf;
		}
	printf("NO\n");
elf:;
	return 0;
}
	

• MS和我的情况是一样的 (764) Sempr 2006-02-25 23:03:28