网易编程答案

#include <iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<sstream>
#include<deque>

using namespace std;
void print(deque<int> &dq)
{
	for (int n : dq)
	{
		cout << n << ' ';
	}
	cout << endl;
}
int max_crazy(deque<int> &dq)
{
	//print(dq);
	int result = 0;
	for (int i = 1; i < dq.size(); i++)
	{
		result += abs(dq[i] - dq[i - 1]);
	}
	return result;
}

int main()
{
	freopen("input.txt", "r", stdin);
	//	freopen("output.txt", "w", stdout);
	int n;
	int temp;
	while (cin >> n)
	{
		deque<int> dq;
		deque<int> dq2;
		for (int i = 0; i < n; i++)
		{
			cin >> temp;
			dq.push_back(temp);
		}
		sort(dq.begin(), dq.end());
		dq2.push_back(dq.back());
		dq.pop_back();

		while (dq.size())
		{

			
			//两次从队列前
			if (dq.size())
			{
				abs(dq.front() - dq2.front()) > abs(dq.front() - dq2.back()) ? dq2.push_front(dq.front()) : dq2.push_back(dq.front());
				dq.pop_front();
			}
			if (dq.size())
			{
				abs(dq.front() - dq2.front()) > abs(dq.front() - dq2.back()) ? dq2.push_front(dq.front()) : dq2.push_back(dq.front());
				dq.pop_front();
			}

			//两次从队尾
			if (dq.size())
			{
				abs(dq.back() - dq2.front()) > abs(dq.back() - dq2.back()) ? dq2.push_front(dq.back()) : dq2.push_back(dq.back());
				dq.pop_back();
			}
			if (dq.size())
			{
				abs(dq.back() - dq2.front()) > abs(dq.back() - dq2.back()) ? dq2.push_front(dq.back()) : dq2.push_back(dq.back());
				dq.pop_back();
			}
			
		}


		cout << max_crazy(dq2) << endl;

	}
}