Codeforces Round #541 (Div. 2) C. Birthday 贪心

题解

题目大意，一个数值序列组成环形，要求相邻两个之间差的绝对值的最大值尽量小，输出排列结果。

输出的序列为先升后降这样才能保证差的最大值最小，直接从小到大排序，先正着输出奇数再倒着输出偶数即可。

AC代码

#include <stdio.h>
#include <bits/stdc++.h>
#define fst first
#define sed second
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int N = 110;
int a[N];

int main()
{
#ifdef LOCAL
	//freopen("C:/input.txt", "r", stdin);
#endif
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		scanf("%d", &a[i]);
	sort(a, a + n);
	for (int i = 0; i < n; i += 2)
		printf("%d ", a[i]);
	reverse(a, a + n);
	for (int i = n & 1; i < n; i += 2)
		printf("%d ", a[i]);
	cout << endl;

	return 0;
}