1085 Perfect Sequence (25分) 测试点5

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 (≤10​5​​) is the number of integers in the sequence, and p (≤10​9​​) is the parameter. In the second line there are N positive integers, each is no greater than 10​9​​.
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
思路：把序列从小到大排序，每个元素做最小值，寻找可以满足完美数列的最大值的数组下标。
测试点5坑：最小值*p可能会超出int范围

#include <iostream>
#include <cstdio>
#include <map>
#include <vector>
#include <string>
#include <memory.h>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <unordered_map>
#include <iomanip>
#include <algorithm>
#include <cmath>
using namespace std;
long long int n, p, maxv = 0, a[100010];
long long int find(int l, int r, long long int x) {
	if (a[r] <= x)
		return n;
	while (l < r) {
		int mid = (l + r) / 2;
		if (a[mid] > x)
			r = mid;
		else
			l = mid + 1;
	}
	return l;
}

int main() {
	cin >> n>>p;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a + n);
	for (int i = 0; i < n; i++) {
		long long int num = find(i + 1, n - 1, a[i] * p);
		maxv = max(maxv, num - i);
	}
	cout << maxv << endl;
}