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

分析：

（1）先排序，关键是如何选择删除最大还是最小。

（2）比较(double((v[j-1]/1.0)/(v[i]/1.0))>double((v[j]/1.0)/(v[i+1]/1.0))) 如果相等则要调用递归：

bool compare(int i,int j){
if (double((v[j-1]/1.0)/(v[i]/1.0))>double((v[j]/1.0)/(v[i+1]/1.0))) return true;
else if (double((v[j-1]/1.0)/(v[i]/1.0))<double((v[j]/1.0)/(v[i+1]/1.0))) return false;
else if  (double((v[j-1]/1.0)/(v[i]/1.0))==double((v[j]/1.0)/(v[i+1]/1.0))) return compare(i+1,j-1);
}

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<long int> v;
bool cmp(int p,int q){
	return p<q;
}
bool compare(int i,int j){
	if (double((v[j-1]/1.0)/(v[i]/1.0))>double((v[j]/1.0)/(v[i+1]/1.0))) return true;
	else if (double((v[j-1]/1.0)/(v[i]/1.0))<double((v[j]/1.0)/(v[i+1]/1.0))) return false;
	else if  (double((v[j-1]/1.0)/(v[i]/1.0))==double((v[j]/1.0)/(v[i+1]/1.0))) return compare(i+1,j-1);
}
int main(){
	long int n,p;
	scanf("%ld %ld",&n,&p);
	for (int k=0;k<n;k++){
		long int tmp;
		scanf("%ld",&tmp);
		v.push_back(tmp);
	}
	sort(v.begin(),v.end(),cmp);
	int i=0,j=v.size()-1;
	while (i<j){
		if (double(p)>=double((v[j]/1.0)/(v[i]/1.0))){
			break;
		}
		else {
			if (compare(i,j)==true){
				i++;
			}
			else{j--;}
		}
	}
	printf("%d",j-i+1);

	return 0;
}