PAT-1085 Perfect Sequence

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 (≤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

    排序后查找就好了，要用二分查找才不会超时。

#include
#include
#include
using namespace std;
typedef long long ll;
vector num;

int findj(ll v){
	int l=0,h=num.size();
	int i=(l+h)/2;
	while(num[i]!=v&&l!=i){
		if(num[i]v)
			h=i;
		else return i;
		i=(l+h)/2;
	}
	return i;
}
int main(){
	int n,p;
	scanf("%d %d",&n,&p);
	for(int i=0;imax)
			max=c;
		if(j==num.size()-1)
			break;
	}
	printf("%d",max);

	return 0;
}