嘟嘟嘟
很简单的折半搜索。
把式子变一下型,得到\(a + b = d - c\)。
然后枚举\(a, b\),存到\(map\)里,再枚举\(c, d\)就好了。
\(map\)以\(a,b\)两数之和为下标。为了判重,\(map\)的第二个参数是一个\(vector\),\(vector\)里面又存了两个数\(a, b\)。
这样先\(O(n ^ 2)\)跑一边\(a, b\)之和,存到\(map\)里,然后从大到小枚举\(d\)和\(c\),遍历\(map\)中\(d - c\)的\(vector\),如果四个数都没有一样的,就直接返回好了。
用\(map\)的最大好处是代码特别短。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<vector>
#include<stack>
#include<queue>
#include<map>
using namespace std;
#define enter puts("")
#define space putchar(' ')
#define Mem(a, x) memset(a, x, sizeof(a))
#define rg register
typedef long long ll;
typedef double db;
const int INF = 0x3f3f3f3f;
const db eps = 1e-8;
const int maxn = 1e3 + 5;
inline ll read()
{
ll ans = 0;
char ch = getchar(), last = ' ';
while(!isdigit(ch)) last = ch, ch = getchar();
while(isdigit(ch)) ans = (ans << 1) + (ans << 3) + ch - '0', ch = getchar();
if(last == '-') ans = -ans;
return ans;
}
inline void write(ll x)
{
if(x < 0) x = -x, putchar('-');
if(x >= 10) write(x / 10);
putchar(x % 10 + '0');
}
int n, a[maxn];
struct Node
{
int x, y;
};
map<int, vector<Node> > mp;
int solve()
{
for(int i = n; i; --i)
for(int j = 1; j < i; ++j)
{
int sum = a[i] - a[j];
for(int k = 0; k < (int)mp[sum].size(); ++k)
{
int x = mp[sum][k].x, y = mp[sum][k].y;
if(a[i] != x && a[i] != y && a[j] != x && a[j] != y)
return a[i];
}
}
return 536870912;
}
int main()
{
while(scanf("%d", &n) && n)
{
mp.clear(); Mem(a, 0);
for(int i = 1; i <= n; ++i) a[i] = read();
sort(a + 1, a + n + 1);
for(int i = 1; i < n; ++i)
for(int j = i + 1; j <= n; ++j)
mp[a[i] + a[j]].push_back((Node){a[i], a[j]});
int ans = solve();
if(ans == 536870912) puts("no solution");
else write(ans), enter;
}
return 0;
}