uva 10125 Sumsets

简单的哈希表应用，将问题转换为a+b=d-c即可

#include <stdio.h>
#include <algorithm>
#include <map>
#include <list>
using namespace std;

int arr[1005];

struct node
{
	int a, b;
};

map<int , list<struct node> > hash_map;

bool is_suitable(int d, int c)
{
	bool f;
	int value;

	value = d-c;

	if(hash_map.find(value) == hash_map.end())
		return false;
	else
	{
		list<struct node>::iterator it;

		f = false;
		for(it=hash_map[value].begin(); it!=hash_map[value].end(); it++)
		{
			if(d!=it->a && d!=it->b && c!=it->a && c!=it->b)
			{
				f = true;
				break;
			}
		}
		return f;
	}
}

void insert_node2hash_map(const struct node &no)
{
	int value;

	value = no.a + no.b;
	hash_map[value].push_back(no);
}

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

void func(int n)
{
	int i, j, res;
	struct node no;
	bool find_solution;

	qsort(arr+1, n, sizeof(int), cmp);
	hash_map.clear();

	for(i=1; i<n; i++)
		for(j=i+1; j<=n; j++)
		{
			no.a = arr[i];
			no.b = arr[j];
			insert_node2hash_map(no);
		}

	find_solution = false;
	for(i=1; i<=n; i++)
		for(j=1; j<=n; j++)
		{
			if(i != j)
			{
				if(is_suitable(arr[i],arr[j]))
				{
					res = arr[i];
					find_solution = true;
					goto end;
				}
			}
		}

end:
	if(find_solution)
		printf("%d\n", res);
	else
		printf("no solution\n");
}

int main(void)
{
	int n, i;
	int data;

	//freopen("input.dat", "r", stdin);

	while(scanf("%d",&n), n)
	{
		for(i=1; i<=n; i++)
			scanf("%d", arr+i);
		func(n);
	}

	return 0;
}