Submission #4030759

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[100005];
ll sum1, sum2;
int main() {
	cin >> n;
	int i;
	for(i = 1; i <= n; ++i) cin >> a[i];
	sort(a + 1, a + 1 + n);
	int hed = 1, til = n;
	while(til - hed + 1 > 2) {
		sum1 += a[til] * 2;
		--til;
		if(til - hed + 1 == 2) break;
		sum1 -= a[hed] * 2;
		++hed;
		if(til - hed + 1 == 2) break;
	}//cout << sum1 << endl;
	if(n & 1) sum1 -= a[til] + a[hed];
	else sum1 += a[til] - a[hed];
	hed = 1, til = n;
	while(til - hed + 1 > 2) {
		sum2 -= a[hed] * 2;
		++hed;
		if(til - hed + 1 == 2) break;
		sum2 += a[til] * 2;
		--til;
		if(til - hed + 1 == 2) break;
	}
	if(n & 1) sum2 += a[til] + a[hed];
	else sum2 += a[til] - a[hed];//cout << sum1 << " " << sum2 << endl;
	cout << max(sum1, sum2);
	return 0; 
}

Submission Info

Judge Result