poj3579 二分

 

 

如题:http://poj.org/problem?id=3579

 

Median
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 4518 Accepted: 1389

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

4
1 3 2 4
3
1 10 2

Sample Output

1
8

Source

 

 

 

思路:对于所有的组合一共C(n,2)种,不可能一一枚举,因此二分C(x):当前x作为中位数偏大?如果偏大,在左边找,否则,在右边找。

对a数组排序,对于a[i],如果>=a[i]+x的个数<=C(n,2)/2,则偏大注意相等时也是偏大,因为中位数落在了右侧区间。

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAXN 100005
#define max(a,b)(a>b?a:b)
int a[MAXN];


int C(int x,int n)
{
 int cnt=0;
 int i;
 for(i=0;i<n;i++)
 {
  cnt+=a+n-lower_bound(a+i,a+n,x+a[i]);
 }
 return cnt<=n*(n-1)/4;
}

int main()
{
 //freopen("C:\\1.txt","r",stdin);
 int n;
 while(cin>>n)
 {
  int i;
  int l=0,r=0;
  for(i=0;i<n;i++)
  {
   scanf("%d",&a[i]);
   r=max(r,a[i]);
  }
  sort(a,a+n);
  while(r-l>1)
  {
   int mid=(l+r)/2;
   if(C(mid,n))
    r=mid;
   else
    l=mid;
  }
  cout<<l<<endl;
 }
 return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值