HDU_2141_Can you find it?

HDU 2141 Can you find it?

题意：给定三个数组，问是否存在A[i]+B[j]+C[k]（这里i,j,k表示位置，相当于数组下标+1，苦逼的博主看成A*i+B*j+C*k了）等于数X。
思路：这里先把A,B合并成一个数组num，再对每个输入的X枚举数组C，直接枚举A,B,C毫无疑问会T。这里给出博主的手写二分和STL中的binary_search方法。C++中的STL确实有很多很强大的功能，但有些东西还是手写几遍的好，对于不同的题，二分的方式也不尽相同，手写会让自己摸索到这种算法的精髓。

 /*******
  手写版
 *******/

#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>

#define debug(x) cout << "--------------> " << x << endl

using namespace std;

const double PI = acos(-1.0);
const double eps = 1e-10;
const long long INF = 0x7fffffff;
const long long MOD = 1000000007;

const int MAXN = 500 + 7;
long long L, N, M, S;
long long A[MAXN], B[MAXN], C[MAXN];
long long num[MAXN*MAXN], len;

int main()
{
    int cnt = 1;
    while(~scanf("%I64d%I64d%I64d", &L, &N, &M))
    {
        len = 0;
        for(int i = 0; i < L; ++i)
            scanf("%I64d", &A[i]);
        for(int i = 0; i < N; ++i)
            scanf("%I64d", &B[i]);
        for(int i = 0; i < L; ++i)
        for(int j = 0; j < N; ++j)
            num[len++] = A[i] + B[j];
        for(int i = 0; i < M; ++i)
            scanf("%I64d", &C[i]);
        scanf("%I64d", &S);
        sort(num, num+len);
        printf("Case %d:\n",cnt++);
        int X;
        while(S--)
        {
            bool flag = false;
            scanf("%I64d", &X);
            if(num[0]+C[0] > X || num[len-1]+C[M-1] < X)  //一个小优化
            {
                printf("NO\n");
                continue ;
            }
            for(int i = 0; i < M; ++i)
            {
                int l = 0, r = len-1, mid;
                while(l <= r)
                {
                    mid = (l+r) / 2;
                    if(num[mid]-X+C[i] >= 0)
                        r = mid - 1;
                    else
                        l = mid + 1;
                }
                if(num[l] == X-C[i])
                {
                        flag = true;
                        break;
                }
            }
            if(flag)
                printf("YES\n");
            else
                printf("NO\n");
        }


    }
     return 0;
}

  /********
    STL版
  ********/

#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>

#define debug(x) cout << "--------------> " << x << endl

using namespace std;

const double PI = acos(-1.0);
const double eps = 1e-10;
const long long INF = 0x7fffffff;
const long long MOD = 1000000007;

const int MAXN = 500 + 7;
long long L, N, M, S;
long long A[MAXN], B[MAXN], C[MAXN];
long long num[MAXN*MAXN], len;

int main()
{
    int cnt = 1;
    while(~scanf("%I64d%I64d%I64d", &L, &N, &M))
    {
        len = 0;
        for(int i = 0; i < L; ++i)
            scanf("%I64d", &A[i]);
        for(int i = 0; i < N; ++i)
            scanf("%I64d", &B[i]);
        for(int i = 0; i < L; ++i)
        for(int j = 0; j < N; ++j)
            num[len++] = A[i] + B[j];
        for(int i = 0; i < M; ++i)
            scanf("%I64d", &C[i]);
        scanf("%I64d", &S);
        sort(num, num+len);
        printf("Case %d:\n",cnt++);
        int X;
        while(S--)
        {
            bool flag = false;
            scanf("%I64d", &X);
            for(int i = 0; i < M; ++i)
            {
                if(binary_search(num+1, num+len, X-C[i]))
                {
                    flag = true;
                    break;
                }
            }
            if(flag)
                printf("YES\n");
            else
                printf("NO\n");
        }


    }
     return 0;
}