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.

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 )

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

41 3 2 431 10 2Sample Output
18
  思路：本题直接使用暴力法，时间复杂度约为n^2，超时，所以采用二分法。
  先把差值分出来，再用二分法验证差值是否符合要求。
#include<algorithm>#include<cstdio>#include<cstdlib>using namespace std;int n,m;int str[100005];int judge(int mid){   int cnt=0;    for(int i=0;i<n;i++)    {        cnt+=n-(lower_bound(str,str+n,str[i]+mid)-str);//C++中STL的查找函数
    }    return cnt>m?1:0;}int main(){   //freopen("e://in.txt","r",stdin);    while(scanf("%d",&n)==1)    {     m=n*(n-1)/4;         for(int i=0;i<n;i++)          scanf("%d",&str[i]);          sort(str,str+n);          int left=0,right=str[n-1]+str[0],mid;          while(left<=right)          {              mid=(left+right)/2;              if(judge(mid))                left=mid+1;              else                right=mid-1;          }          printf("%d/n",left-1);    }    return 0;}
总结：lower_bound函数的引用