zoukankan      html  css  js  c++  java
  • Median POJ

    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

    1.二分答案和二分验证。
    2.验证的时候要找大于中间值的差值。
    3.这是大神(不是本人)的代码~~~
     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstdio>
     4 #include<string>
     5 #include<cstring>
     6 #include<cmath>
     7 #define MAX 100005
     8 using namespace std;
     9 typedef long long ll;
    10 
    11 int n,m;
    12 ll a[MAX];
    13 
    14 bool check(ll ans){
    15     int cnt=0;
    16     for(int i=1;i<=n;i++)
    17         cnt+=n-(lower_bound(a+1,a+n+1,a[i]+ans)-a-1);
    18     if(cnt>m) return true;
    19     else return false;
    20 }
    21 int main()
    22 {  while(~scanf("%d",&n)){
    23       
    24       for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    25       sort(a+1,a+n+1);
    26       m=n*(n-1)/4;
    27       ll l=0,r=a[n]-a[1];
    28       ll mid,ans;
    29       while(l<=r){
    30            mid=(l+r)>>1;
    31            if(check(mid)){
    32                ans=mid;
    33                l=mid+1;
    34            }
    35            else r=mid-1;
    36       }
    37       printf("%d
    ",ans);
    38    } 
    39    return 0;
    40 }


  • 相关阅读:
    全国各地DNS(电信,移动,联通,教育网)
    全国各地电信DNS服务器地址
    免费公共 DNS 大全
    免费公共DNS服务器 全球DNS服务器 国内DNS服务器
    AT指令发送短信
    OpenWrt 定期检测进程是否存在并重启
    OpenWrt 计划任务使用方法
    openwrt-mt7688 修改默认的WIFI SSID
    在MT7628实现wan、wwan与4G动态切换
    Unix常用命令之修改密码
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/6765119.html
Copyright © 2011-2022 走看看