hdu 2141(排序+二分)

/*
*  排序+二分 
*/

#include <stdio.h>
#include <stdlib.h>
#define N 501

int a[N], b[N*N], c[N];

int cmp(const void *a, const void *b) {
    return *(int *)a - *(int *)b;
}

int main() {
    int l, n, m, s, i, j, k, tmp, tmpp, left, right, mid, flag, cas = 0;
    while (scanf("%d%d%d", &l, &n, &m) != EOF) {
        for (i=0; i<l; ++i) scanf ("%d", &a[i]);
        for (k=-1,i=0; i<n; ++i) {
            scanf ("%d", &tmp);
            for (j=0; j<l; ++j) b[++k] = tmp + a[j];  
        }
        for (i=0; i<m; ++i) scanf ("%d", &c[i]);
        qsort(b, k+1, sizeof(int), cmp);
        scanf ("%d", &s);
        printf ("Case %d:\n", ++cas);
        while (s--) {
            scanf ("%d", &tmpp);
//            if (tmpp-c[0]<b[0] || tmpp-c[m-1]>b[k]) {puts("NO"); continue;} 
            flag = 0;
            for (i=0; i<m; ++i) {
                tmp = tmpp - c[i];
                left = 0;
                right = k;
                while (left <= right) {
                    mid = (left + right) >> 1;
                    if (tmp == b[mid]) { flag = 1; break;}
                    else if (tmp < b[mid]) right = mid - 1;
                    else left = mid + 1;
                }
                if (flag) break;
            }
            if (flag) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}