POJ 3579 Median（2次二分）

Given N numbers, X₁,X₂, ... , X_N, let us calculate the difference of every pair of numbers: ∣X_i- X_j∣ (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 ifm,the amount of the differences, is even. For example, you have to find the third smallest one in the case ofm = 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, representingX₁, X₂, ... ,X_N, ( X_i≤ 1,000,000,000  3 ≤ N ≤ 1,00,000 )

Output

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

Sample Input

4
1 3 2 4
3
1 10 2

Sample Output

1
8

  思路：本题直接使用暴力法，时间复杂度约为n^2，超时，所以采用二分法。

  二分差值

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
int n,m;
int s[100005];
int judge(int mid)
{
    int cnt=0;
    for(int i=0;i<n;i++)
    {
        cnt=cnt+n-(lower_bound(s,s+n,s[i]+mid)-s); //找出来比s[i]+差值大的数有多少个
    }
    return cnt>m?1:0;
}
int main()
{
    while(scanf("%d",&n)==1)
    {
        m=n*(n-1)/4;
        for(int i=0;i<n;i++)
            scanf("%d",&s[i]);
        sort(s,s+n);
        int l=0,r=s[n-1]-s[0],mid,res;
        while(l<=r)                 //二分差值
        {
            mid=(l+r)/2;
            if(judge(mid))
            {
                 l=mid+1;
                 //res=l;
            }
            else
                r=mid-1;
        }
        printf("%d\n",l-1);
    }
}