Median

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

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11225		Accepted: 4016

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

 1 #include<iostream>
 2 #include<algorithm>
 3 #include<string>
 4 #include<map>
 5 #include<vector>
 6 #include<cmath>
 7 #include<string.h>
 8 #include<stdlib.h>
 9 #include<stack>
10 #include<queue>
11 #include<cstdio>
12 #define ll long long
13 const long long MOD=1000000007;
14 #define maxn 100005
15 using namespace std;
16
17 int n;
18 int m;
19 int a[maxn];
20
21 bool Check(int mid){
22     int sum=0;
23     int p;
24     for(int i=1;i<=n;i++){
25         p=upper_bound(a+1,a+n+1,a[i]+mid)-a;
26         sum+=p-i-1;//排除a[i]之前的那些元素,共有i+1;
27     }
28     if(sum>=m){
29         return true;
30     }
31     return false;
32 }
33
34 int main(){
35     while(~scanf("%d",&n)){
36         m=n*(n-1)/2;
37         m=(m+1)/2;
38         for(int i=1;i<=n;i++){
39             scanf("%d",&a[i]);
40         }
41         sort(a+1,a+n+1);
42         ll L=0,R=1000000000,mid;
43         while(L<=R){
44             mid=L+R>>1;
45             if(Check(mid)){
46                 R=mid-1;
47             }
48             else{
49                 L=mid+1;
50             }
51         }
52         printf("%d\n",L);
53     }
54
55 }

View Code

转载于:https://www.cnblogs.com/Fighting-sh/p/10054652.html

Median(二分+二分)相关推荐

【hiho】38 二分·二分答案【二分答案】
传送门:二分·二分答案分析因为两个相邻战略点之间可能不止一条航线,所以不能够用邻接矩阵来存储图. 用邻接表来存储,用数组模拟. 二分答案就是二分枚举答案,验证答案的正确性,每次验证可将范围缩小一 ...
Bridging signals（二分二分+stl dp）
欢迎参加--每周六晚的BestCoder(有米!) Bridging signals Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 6 ...
hdu2413 二分+二分匹配
题意: 地球和外星球大战,地球有n个飞船,外星球有m个飞船,每个飞船有自己的其实战舰和战舰增长率,星球于星球之间有距离,问你最少多少年地球可以打败外星球,每个星球最多只能和一个星球对战.. ...
【HIHOCODER 1133】二分·二分查找之k小数
描述在上一回里我们知道Nettle在玩<艦これ>,Nettle的镇守府有很多船位,但船位再多也是有限的.Nettle通过捞船又出了一艘稀有的船,但是已有的N(1≤N≤1,000,000) ...
bzoj 4443: [Scoi2015]小凸玩矩阵（二分+二分匹配）
4443: [Scoi2015]小凸玩矩阵 Time Limit: 10 Sec Memory Limit: 128 MB Submit: 1002 Solved: 505 [Submit][St ...
牛客试卷：浩鲸科技2019校招算法类笔试题经典二分二分答案
珂珂喜欢吃香蕉.这里有 N 堆香蕉,第 i 堆中有 piles[i] 根香蕉.警卫已经离开了,将在 H 小时后回来. 珂珂可以决定她吃香蕉的速度 K (单位:根/小时).每个小时,她将会选择一堆香蕉, ...
POJ 2456 Aggressive cows(二分答案)
Aggressive cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22674 Accepted: 10636 Des ...
ACM入门之【二分】
二分分为: 整数二分浮点数二分二分可以解决的问题:如果它左边的区间不满足条件,右边区间都满足条件. 那么就可以用二分O(log2n)的时间复杂度解决问题. 模板 bool check(int x) ...
90%的程序员都写错的算法-二分查找万能模版
新的角度看二分二分就是将数组分为两段因此,问题的最终目标是找出蓝红边界朴素算法红色指针一开始指向最右超出范围处,随后不断向左移动,直到找到蓝红边界:或者蓝色指针- 时间复杂度O(n)O(n)O ...

Median(二分+二分)

Median

Median(二分+二分)相关推荐

最新文章

热门文章