Codeforces 1189B Number Circle

题意：给一串序列，求能否构成一个数字环，环中每个数字都小于相邻数字和
思路：首先想到dfs，稍微剪了点小枝，结果还是超时，实在想不到别的剪枝方案了

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, a[maxn], vis[maxn], ans;
vector<int> v;
void solve(int k)
{
	if (ans == 1)
		return;
	if (v.size() == n) {
		for (int i = 0; i < v.size(); i++) {
			if (i == 0 && v[i] >= v[v.size()-1]+v[1]) 
				return;
			if (i == v.size()-1 && v[i] >= v[v.size()-2]+v[0])
				return;
			if (v[i] >= v[i-1]+v[i+1])
				return;
		}
		ans = 1;
		printf("YES\n");
		for (int i = 0; i < v.size(); i++) {
			printf("%d ", v[i]);
		}
		printf("\n");
		return;	
	}
	for (int i = 0; i < n; i++) {
		if (ans)
			break;
		if (v.size() >= 2) {
			if (v.back() >= v[v.size()-2]+a[i])
				break;
		}
		int r = i == n-1 ? 0 : i+1;
		if (a[i] >= a[k]+a[r])
			break;
		if (!vis[i]) {
			vis[i] = 1;
			v.push_back(a[i]);
			solve(i);
			v.pop_back();
			vis[i] = 0;
		}
	}
}
int main()
{
	while (cin >> n) {
		memset(vis, 0, sizeof(vis));
		ans = 0;
		for (int i = 0; i < n; i++)
			cin >> a[i];
		solve(0);
		if (!ans)
			printf("NO\n");
	}
	return 0;
}

再看答案，基本没一个用搜索求的，都是类似用下面这种方法：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, a[maxn], ans;
int main()
{
	while (cin >> n) {
		ans = 0;
		for (int i = 0; i < n; i++)
			cin >> a[i];
		sort(a, a+n);
		if (a[n-1] >= a[n-2]+a[n-3])
			cout << "NO" << endl;
		else {
			printf("YES\n");
			int n1 = a[n-1], n2 = a[n-2], n3 = a[n-3];
			a[n-1] = n3;
			a[n-2] = n1;
			a[n-3] = n2;
			for (int i = 0; i < n; i++)
				printf("%d ", a[i]);
			printf("\n");
		}
	}
	return 0;
}

感觉思路真的太清奇了，有大神能解释一下为什么这样可以AC吗。。