题意
传送门 POJ 3579
先处理掉绝对值。对数列升序排序,则绝对值可化为
X i − X j , j < i X_{i}-X_{j},j<i Xi−Xj,j<i
根据等差数列求和公式,对于偶数、奇数情况, m e d i a n median median 都是第 N ∗ ( N − 1 ) / 2 / 2 + 1 N*(N-1)/2/2+1 N∗(N−1)/2/2+1 小的数。此时二分搜索可能的 m e d i a n median median;对于每一个 X i X_{i} Xi,其 X j , j < i X_{j},j<i Xj,j<i 代表的绝对值都是有序的,遍历 N − 1 N-1 N−1 个数字,二分求满足 X i − X j > m i d X_{i}-X_{j}>mid Xi−Xj>mid 的个数即可。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define max(a,b) (((a) > (b)) ? (a) : (b))
#define abs(x) ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-5
#define PI 3.14159265358979323846
#define MAX_N 100005
using namespace std;
typedef long long LL;
int N;
LL K;
int X[MAX_N];
bool C(int x){
LL s = 0;
for(int i = 1; i < N; i++) s += lower_bound(X, X + i, X[i] - x) - X;
return s < K;
}
int main(){
while(~scanf("%d", &N)){
for(int i = 0; i < N; i++) scanf("%d", X + i);
K = (LL)N * (N - 1) / 4 + 1;
sort(X, X + N);
int lb = 0, ub = X[N - 1] - X[0];
while(ub - lb > 1){
int mid = (lb + ub) >> 1;
if(C(mid)) ub = mid;
else lb = mid;
}
printf("%d\n", ub);
}
return 0;
}