POJ 3579 二分

Median

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7687		Accepted: 2637

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

Source

POJ Founder Monthly Contest – 2008.04.13, Lei Tao

题意：

有n个数，每两个数差的绝对值组成一个新的数列，求此数列的中位数偶数时求第m/2小的数

代码：

//两重二分，先将a数组从小到大排序，第一重二分中位数的值m，第二重枚举a[i],找到有多少

//个 |a[j]-a[i]| >= m，将这个数量与n*(n-1)/4比较作为二分的判断条件

#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

const int maxn=;

int n,a[maxn];

ll k;

bool solve(int m){

    ll cnt=;

    for(int i=;i<n;i++){

        int id=lower_bound(a+i,a+n,a[i]+m)-a;

        cnt+=n-id;

    }

    return cnt>k;

}

int main()

{

    while(scanf("%d",&n)==){

        k=1LL*n*(n-)/;

        for(int i=;i<n;i++)

            scanf("%d",&a[i]);

        sort(a,a+n);

        int l=,r=,ans;

        while(l<=r){

            int m=(l+r)>>;

            if(solve(m)){

                ans=m;

                l=m+;

            }else r=m-;

        }

        printf("%d\n",ans);

    }

    return ;

}

巴特西

POJ 3579 二分

最新文章

热门文章