HDU 2141

       一道二分搜索的题。

       开始看到这道题，想暴搜一下，可是数据量太大，我抱着试一试的心态用DFS+剪枝，然后就悲剧的TLE了，无奈看了别人的做法，选择的二分搜索。

       要想二分搜索，首先对公式变个形，变成A+B=X-C。然后合并A+B数组，组成一个新的数组AB，枚举C数组的元素，对得到X-C进行二分搜索。可以自己写一个二分，也可以用<algorithm>中的binary_search函数，具体用法详见：binary_search。

代码（C++）：

#include <iostream>
#include <cstdio>
#include <algorithm>

#define MAX 509
using namespace std;

int abc[3][MAX],len[3];
long long ab[MAX*MAX];

bool bsearch(int a,int b,int n)
{
    int mid;
    while(a<b)
    {
        mid=(a+b)/2;
        if(ab[mid]==n) return true;
        if(ab[mid]>n) b=mid;
        else a=mid+1;
    }
    return false;
}

int main()
{
    //freopen("in.txt","r",stdin);

    int i,j,t,sum,S,c;
    t=1;
    while(scanf("%d %d %d",&len[0],&len[1],&len[2])!=EOF)
    {
        for(j=0;j<3;j++)
        {
            for(i=0;i<len[j];i++) scanf("%d",&abc[j][i]);
        }
        c=0;
        for(i=0;i<len[0];i++)
        {
            for(j=0;j<len[1];j++)
            {
                ab[c++]=(long long)abc[0][i]+abc[1][j];
            }
        }
        sort(ab,ab+c);
        c=unique(ab,ab+c)-ab;

        printf("Case %d:\n",t++);
        scanf("%d",&S);
        for(i=0;i<S;i++)
        {
            scanf("%d",&sum);
            for(j=0;j<len[2];j++)
            {
                if(bsearch(0,c,sum-abc[2][j]))
                {
                    printf("YES\n");
                    break;
                }
                /*if(binary_search(ab,ab+c,sum-abc[2][j]))
                {
                    printf("YES\n");
                    break;
                }*/
            }
            if(j==len[2]) printf("NO\n");
        }
    }
    return 0;
}

题目（ http://acm.hdu.edu.cn/showproblem.php?pid=2141）：

Can you find it?

Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/10000 K (Java/Others)

Problem Description

Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.

 

Input

There are many cases. Every data case is described as followed: In the first line there are three integers L, N, M, in the second line there are L integers represent the sequence A, in the third line there are N integers represent the sequences B, in the forth line there are M integers represent the sequence C. In the fifth line there is an integer S represents there are S integers X to be calculated. 1<=L, N, M<=500, 1<=S<=1000. all the integers are 32-integers.

 

Output

For each case, firstly you have to print the case number as the form "Case d:", then for the S queries, you calculate if the formula can be satisfied or not. If satisfied, you print "YES", otherwise print "NO".

 

Sample Input

  
  

   
   3 3 3
1 2 3
1 2 3
1 2 3
3
1
4
10
  
  

 

Sample Output

  
  

   
   Case 1:
NO
YES
NO