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⁵) is the number of integers in the sequence, and p (<= 10⁹) is the parameter. In the second line there are N positive integers, each is no greater than 10⁹.

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;
int a[100005],n,p;
int binarysearch(int i,long long x){
if (a[n-1]<=x) return n;
int left=i-1;
int right=n-1;
while(left<right) {
int mid=(left+right)/2;
if(a[mid]<=x) {
left=mid+1;
}
        else  right=mid; 
}
return left; //left==right
} 
int main(){
scanf("%d%d",&n,&p);
for (int i=0;i<n;i++) {
scanf("%d",&a[i]);
}
sort(a,a+n);
int ans=1,j;
for (int i=0;i<n;i++) {
j=binarysearch(i,(long long)(a[i]*p));
ans=max(ans,j-i);
}
printf("%d",ans);
}

另解（用双指针）：

#include<cstdio>
#include<algorithm>
using namespace std;
int main() {
int n,p,a[100005];
scanf("%d%d",&n,&p);
for (int i=0;i<n;i++){
scanf("%d",&a[i]);
}
sort(a,a+n);
int cnt=1;
int i=0,j=0;
while(i<n&&j<n) {
while(j<n&&a[j]<=(long long)a[i]*p){
cnt=max(cnt,j-i+1);
j++;
}
i++;
}
printf("%d\n",cnt);
return 0;
}