1085 Perfect Sequence (25 分)

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

示例代码：

注意点：1、number[i]*p可能超过int类型数据，因此用long long int;

              2、要考虑，所有的number均小于p的情况，例如：

              3   9

              1   2   3 

              3、可以用upper_bound代替二分法代码，upper_bound（number+i+1,number+n,(long long)number[i]*p）-number;

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int find_high(long long int number[],int low, int high,long long int x) {
	int mid,left=low,right=high;
	if (number[high] <= x)
		return high+1;
	while (left<right)
	{
		mid = (left + right) / 2;
		if (number[mid]<x) {
			left = mid + 1;
		}
		else
		{
			right = mid;
		}
	}
	return left;
}
int main(void) {
	long long int N, p;
	long long int number[100001];
	scanf_s("%lld %lld", &N, &p);
	for (int i = 0;i < N;i++) {
		scanf_s("%lld", &number[i]);
	}
	sort(number, number + N);
	int length = 0;
	for (int i = 0;i < N - 1;i++) {
		int high = find_high(number, i + 1, N - 1, number[i]*p);
		int temp = high - i;
		if (temp > length) {
			length = temp;
		}
	}
	printf_s("%d", length);
}