pat-1085 Perfect Sequence(25)（二分法，利用upper_bound()函数）

本文链接：https://blog.csdn.net/hzyhfxt/article/details/82351346

Given a sequence of positive integers and another positive integer p. The sequence is said to be a perfect sequence if M≤m×p where M and m are the maximum and minimum numbers in the sequence, respectively.

Now given a sequence and a parameter p, you are supposed to find from the sequence as many numbers as possible to form a perfect subsequence.

Input Specification:

Each input file contains one test case. For each case, the first line contains two positive integers N and p, where N (≤105) is the number of integers in the sequence, and p (≤109) is the parameter. In the second line there are N positive integers, each is no greater than 109.

Output Specification:

For each test case, print in one line the maximum number of integers that can be chosen to form a perfect subsequence.

Sample Input:
10 8
2 3 20 4 5 1 6 7 8 9
Sample Output:
8
作者: CAO, Peng

单位: 浙江大学

时间限制: 200 ms

内存限制: 64 MB

代码长度限制: 16 KB

这里用到一个函数->upper_bound( begin,end,num)：从数组的begin位置到end-1位置二分查找第一个大于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

upper_bound具体用法参见->链接

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 +5;
int a[maxn];

int main()
{
    int n,p;
    cin>>n>>p;
    for(int i = 0;i < n;i++)
    {
        cin>>a[i];
    }
    sort(a,a + n);
    int ans = 1;
    for(int i = 0 ;i < n;i++)
    {
        int j = upper_bound(a + i + 1, a + n,(ll)a[i] * p) - a;
        ans = max(ans,j - i);//最大长度
    }
    printf("%d\n",ans);
    return 0;
}