[POJ3579]Median

最新推荐文章于 2022-02-08 10:15:00 发布

dxyinme

最新推荐文章于 2022-02-08 10:15:00 发布

阅读量201

点赞数

分类专栏： ---------------------分治

本文链接：https://blog.csdn.net/dxyinme/article/details/81293445

版权

---------------------分治专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Time Limit: 1000MS
Memory Limit: 65536K

Description

Given N numbers,X1, X2, … , XN, let us calculate the difference of every pair of numbers: $∣Xi - Xj∣ (1 ≤ i ＜ j ≤ N)$ . We can get $C(N,2)$ differences through this work, and now your task is to find the median of the differences as quickly as you can!

Note in this problem, the median is defined as the $(m/2)-th$ smallest number if m,the amount of the differences, is even. For example, you have to find the third smallest one in the case of m = 6.

Input

The input consists of several test cases.
In each test case, N will be given in the first line. Then N numbers are given, representing $X1, X2, ... , XN, ( Xi ≤ 1,000,000,000 )$ $(3 ≤ N ≤ 1,00,000 )$

Output

For each test case, output the median in a separate line.

Sample Input

Sample Output

1
8

Source

POJ Founder Monthly Contest – 2008.04.13, Lei Tao

题意：
一个长度为100000的数列{ $Xn$ }，求 $∣Xi - Xj∣ (1 ≤ i ＜ j ≤ N)$ 的中位数
题目种可能没讲清楚，如果 $n*(n-1)/2$ 是偶数的话，那么中位数是第 $n*(n-1)/4$ 小的数字否则中位数是第 $n*(n-1)/4+1$ 小的数字
题解：
先将数列{ $Xn$ }排序。
我们只需要二分这个中位数ANS是多少，然后判断有多少个数字比他小就好了。但是由于在中位数周围会出现相同数字连在一起的情况，那么我们就二分ANS+1就好了。对于确定的Xi，判断所有 $Xj - Xi (j>i)$ 有多少个数字比ANS+1小，只要从 $j∈[i+1,n]$ ，二分出一个最大的j使得 $Xj < Xi+ANS+1$ 就好了，就可以快速统计 $Xj < Xi+ANS+1$ 的数量。
然后答案就是ANS

#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstdio>
#define LiangJiaJun main
#define ll long long
#define eps (1e-6)
using namespace std;
int n,k,a[100004];
ll lim;
ll  calc(int l,int r,int x){
    ll mid,st=-1,bg=l;
    while(l<=r){
        mid=(l+r)>>1;
        if(a[mid]<x){
            st=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    if(st==-1)return 0;
    return st-bg+1;
}
ll  check(int x){
    ll sum=0;
    for(int i=1;i<=n;i++){
        sum+=calc(i+1,n,a[i]+x);
    }
    return sum;
}
int w33ha(){
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    lim=(1LL*n)*(n-1LL)/2;
    if(lim&1)lim=lim/2+1;
    else lim/=2;
    ll mid,L=0,R=a[n]-a[1],ans=-1;
    while(L<=R){
        mid=(L+R)>>1;
        if(lim<=check(mid)){
            ans=mid;
            R=mid-1;
        }
        else L=mid+1;
    }
    printf("%d\n",ans-1);
    return 0;
}
int LiangJiaJun (){
    while(scanf("%d",&n)!=EOF)w33ha();
    return 0;
}