二分搜索（两次）-poj3579

最新推荐文章于 2019-04-09 14:09:44 发布

u010660276

最新推荐文章于 2019-04-09 14:09:44 发布

阅读量1.9k

点赞数

分类专栏：二分搜索

本文链接：https://blog.csdn.net/u010660276/article/details/16857887

版权

二分搜索专栏收录该内容

51 篇文章 1 订阅

订阅专栏

Language:

Median

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3418		Accepted: 944

Description

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 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 X₁, 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

Sample Output

1
8

思路：先从小到大排序，然后二分枚举答案，判断是否可行，判断的时候再二分，统计与a[i]的值差距小于mid的数的个数，看是否小于
m。
下面是代码：
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX=100100;
int N,m;
int a[MAX];

int binary(int x,int y,int p,int d)
{
    if(x>y)
        return y;
    int mid=(x+y)/2;
    if(p-a[mid]<=d)
        return binary(x,mid-1,p,d);
    else
        return binary(mid+1,y,p,d);
}
bool can(int mid)
{
    int k=0,j;
    for(int i=2;i<=N;i++)
    {
        j=binary(1,i-1,a[i],mid);//找与a[i]差值比mid小的数的个数
        k+=i-j-1;
    }
    if(k>=m)
        return true;
    return false;
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(cin>>N)
    {
        for(int i=1;i<=N;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+N+1);
        int l=0,r=2000000001,mid;
        //判断奇偶
        if((N*(N-1)/2)%2)
            m=(N*(N-1)/2+1)/2;
        else
            m=N*(N-1)/4;
        while(r>=l)
        {
            mid=(r+l)>>1;
            if(can(mid))
                r=mid-1;
            else
                l=mid+1;
        }
        cout<<l<<endl;
    }
    return 0;
}