PAT A1085

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<cstdio> 
#include<algorithm>
using namespace std;
long long a[100010],n,p;

int bS(int l,int r,long long x){
	if(a[n-1]<=x) return n;
	int mid;
	while(l<r)
	{
		mid=(l+r)/2;
		if(a[mid]<=x)//r最终等于l 退出循环 因为上一个循环 l=nid amid>x, 故为第一个大于x的地方 
		l=mid+1;
		else
		r=mid;
	}
	return l;
}


int main()
{
	scanf("%lld%lld",&n,&p);
	long long t;
	for(int i=0;i<n;i++)
	scanf("%d",&a[i]);
	sort(a,a+n);
	int ans=-1;
	for(int i=0;i<n;i++)
	{
		t=a[i]*p;
		int j=bS(i+1,n-1,t);//i+1?
		ans=max(ans,j-i);
	}
	printf("%d",ans); 
	return 0; 
 } 
 /*
10 1
2 3 20 4 5 1 6 7 8 9

 */