poj3579 双重二分,有意思的一道题,注意二分边界
来源:互联网 发布:农村淘宝五个一是什么 编辑:程序博客网 时间:2024/05/23 12:26
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 ifm,the amount of the differences, is even. For example, you have to find the third smallest one in the case ofm = 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, representingX1, X2, ... ,XN, ( Xi≤ 1,000,000,000 3 ≤ N ≤ 1,00,000 )
Output
For each test case, output the m
#include<iostream>#include<algorithm>#include<cstdio>using namespace std;int a[100005];int n,num;int bin(int x){//cout<<"x:"<<x<<endl;int l=0,r=n-1,mid;while(l<r){mid=(l+r)/2;if (a[mid]<=x){l=mid+1;}else r=mid;}//cout<<"bin:"<<n-1-r+1<<endl;return n-1-r+1;} int pan(int guess){//cout<<"guess:"<<guess<<endl;int count=0;for (int i=0;i<n;i++){if (a[i]+guess>=a[n-1]) break;count+=bin(a[i]+guess);if (count>num) return -1;}if (count<=num) return 0;}int main(){while(scanf("%d",&n)!=EOF){num=(n)*(n-1)/2;num/=2;for (int i=0;i<n;i++){scanf("%d",&a[i]);}sort(a,a+n);int r=a[n-1]-a[0];int l=0,mid;int flag;while(l<r){mid=(l+r)/2;flag=pan(mid);if (flag==0){r=mid;}else if (flag==-1) l=mid+1;}printf("%d\n",l);}}
edian in a separate line.
Sample Input
41 3 2 431 10 2
Sample Output
18
排序之后,从0 到 最大差值进行二分搜索,判断guess值是否满足大于a[i]+guess的一共有count个,这里计数用到了第二次二分,找到上界,返回末尾与它的下标2差,如果没有那么多,说明guess值猜大了,有的话还是要继续猜,因为不能保证当前guess值是在原数组中出现过的,
- poj3579 双重二分,有意思的一道题,注意二分边界
- poj3579 二分
- POJ3579 二分
- POJ3579 二分判定+二分查找
- POJ3579 Median(二分查找)
- poj3579 Median 二分
- POJ3579:Median(二分)
- POJ3579--Median(二分)
- 一道神奇的二分题
- 双重二分查找的应用
- 二分搜索(两次)-poj3579
- POJ3579 Median —— 二分
- poj3579,二分找答案,再二分查找
- 二分边界
- poj3579 Median (二分-查找第K大的值)
- leetcode 374—注意溢出,二分左边界,右边界
- 有意思的一道题
- 一道有意思的题
- 运用主成分分析法预测病毒(未完善)
- 打开新窗口(window.open)
- android退出时弹出提示框
- 碰撞检测之OBB-OBB检测
- 一个程序,让你清楚区分二进制文件和文本文件
- poj3579 双重二分,有意思的一道题,注意二分边界
- hiho一下 第八十八周 Coordinates (求约数)
- python -抽象那些事
- 明大推荐系统导论笔记 week 1
- Linux中ELF格式文件介绍
- 冒泡排序
- 数独
- 向量化思想学习笔记
- PAT1041考试座位号