10125 - Sumsets UVA

Problem C - Sumsets

Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.

Input

Several S, each consisting of a line containing an integer 1 <= n <= 1000 indicating the number of elements in S, followed by the elements of S, one per line. Each element of S is a distinct integer between -536870912 and +536870911 inclusive. The last line of input contains 0.

Output

For each S, a single line containing d, or a single line containing "no solution".

Sample Input

5
2 
3 
5 
7 
12
5
2 
16 
64 
256 
1024
0

Output for Sample Input

12
no solution

看上去比较简单的方法（哈希表）http://blog.csdn.net/frankiller/article/details/7835414

以下是自己暴力求解的代码;

关键：

通过枚举最大值d和b，c

然后再通过二分法搜索a（必须保证abcd互不相同！！！！！！！）

代码如下：

#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
using namespace std;
const int maxn = 10;
int num[1000 + maxn];
int i,j,k;
bool cmp(int x,int y)//从大到小排序
{
    return x>y;
}
int find(int n,int l,int r)//二分查找a
{
   int mid = (r-l)/2+l;
   if(l>r)
   return 0;
   if(n==num[mid])
   {
       if(mid!=i&&mid!=j&&mid!=k)
       return 1;
       else
       return 0;
   }
   else
   {
       if(n>num[mid])
       find(n,l,mid-1);
       else
       if(n<num[mid])
       find(n,mid+1,r);
   }
}
int main()
{
    int s;
    while(scanf("%d",&s)==1)
    {
        if(s==0)
        break;
        for(i = 0;i<s;++i)
        scanf("%d",&num[i]);

        sort(num,num+s,cmp);

        int ans;
        int tag = 0;
        for(i = 0;i<s;++i)//穷举d
          for(j = 0;j<s-1;++j)//因为输入的数可以是负数所以必须从头到尾再次穷举b
            for(k = 0;k<s;++k)//再次穷举c
            {
                ans = num[i];
                if(i!=j&&i!=k&&j!=k&&find(num[i]-num[j]-num[k],0,s-1))
                {
                    tag=1;
                    goto here;
                }

            }
            here:
            if(!tag)
            printf("no solution\n");
            else
            printf("%d\n",ans);
    }
    return 0;
}