hdu 2141(二分)

//hdu 2141
/*主要题意：分别给l,n,m个a,b,c，要求是否存在ai+bj+ck = x
思路：列出所有ai与bj相加的结果，将与ck相加的结果与M进行比较*/

#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int a,int b)
{
return a < b;
}
__int64 a[505],b[505],c[505];
__int64 k[3000000];
int main()
{
int i,j,t;
int n,m;
int s1,s2,s3;
int p = 1;
__int64 l,r,mid;
int f;

while(~scanf("%d %d %d",&s1,&s2,&s3))
{
for(i = 0;i < s1;i ++)
{
scanf("%I64d",&a[i]);
}
for(i = 0;i < s2;i ++)
{
scanf("%I64d",&b[i]);
}
for(i = 0;i < s3;i ++)
{
scanf("%I64d",&c[i]);
}
t = 0;
for(i = 0;i < s1;i ++)
{
for(j = 0;j < s2;j ++)
{
k[t ++] = a[i] + b[j];
}
}
sort(k,k + t,cmp);
scanf("%d",&n);
printf("Case %d:
",p ++);
for(i = 0;i < n;i ++)
{
scanf("%d",&m);
f = 0;
for(j = 0;j < s3;j ++)
{
if(k[0] + c[j] <= m && k[t - 1] + c[j] >= m)
{
l = 0;
r = t - 1;
while(l <= r)
{
mid = (l + r)/2;
if(k[mid] + c[j] < m)
{
l = mid + 1;
}
else if(k[mid] + c[j] > m)
{
r = mid - 1;
}
else
{
f = 1;
break;
}
}
if(f)
break;
}
if(f)
break;
}
if(f)
printf("YES
");
else
printf("NO
"); 
} 
}
return 0;
}