zoj 1101 搜索

#include<iostream>
#include<algorithm>
//二分查找在搜索中应用
using namespace std;

int main()
{
	int n,i,j,k;
	bool sign;
	int *a;
	cin>>n;
	while(n)
	{
		sign=true;
		a=new int[n];
		for(i=0;i<n;i++)
			cin>>a[i];
		sort(a,a+n);
		for(i=n-1;i>=0&&sign;i--)
		{
			for(j=0;j<n&&sign;j++)
			{
				for(k=0;k<n&&sign;k++)
				{
					 if (i != j && j != k && i != k)  
	                {  
						 //cout<<i<<"   ";
	                    int value =	a[i] - a[j] - a[k];  
	                    if (value != a[i] && value != a[j] && value != a[k] && binary_search(a, a + n, value))  
	                    {  
							//cout<<value<<endl;
							cout << a[i] << endl;  
							sign=false;  
						}  
					}  
				}
			}
		}
		if(sign) cout<<"no solution"<<endl;
		delete a;
		cin>>n;
	}
	return 0;
}