【题解】LOJ3252：「JOI 2020 Final」只不过是长的领带

原题传送门
有一个很显然的贪心思想，都从小到大排序，然后直接两两配对就行了
证明：

a<b
c<d
一种方案，max(a-c,b-d,0)
另一种,max(a-d,b-c,0)=max(b-c,0)
发现一定是前一种方案更优

然后排好序后，每次就是扔掉一个$a_i$
那么配对情况就是

a1 a2 a3…ai-1,ai+1,…,an+1
b1 b2 b3…bi-1,bi,…,bn

对于每个$b_i$，求出$a_i-b_i,a_{i+1}-b_i$

Code：

#include <bits/stdc++.h>
#define maxn 200010
using namespace std;
struct data{
	int x, id;
}a[maxn];
int n, b[maxn], c[maxn], d[maxn], pre[maxn], nxt[maxn], ans[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

bool cmp(data x, data y){
	return x.x < y.x;
}

int main(){
	n = read();
	for (int i = 1; i <= n + 1; ++i)
		a[i].x = read(), a[i].id = i;
	sort(a + 1, a + 1 + n + 1, cmp);
	for (int i = 1; i <= n; ++i) b[i] = read();
	sort(b + 1, b + 1 + n);
	for (int i = 1; i <= n; ++i){
		c[i] = max(0, a[i].x - b[i]);
		d[i] = max(0, a[i + 1].x - b[i]);
	}
	for (int i = 1; i <= n; ++i) pre[i] = max(pre[i - 1], c[i]);
	for (int i = n; i; --i) nxt[i] = max(nxt[i + 1], d[i]);
	for (int i = 1; i <= n + 1; ++i) ans[a[i].id] = max(pre[i - 1], nxt[i]);
	for (int i = 1; i <= n + 1; ++i) printf("%d ", ans[i]);
	return 0;
}