1085 Perfect Sequence (25point(s))

问题

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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	long long n, p, tmp = 0, final = 0;
	cin >> n >> p;
	vector<int>v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < n; i++) {
		for (int j = i + final; j < n; j++) {
			if (v[j] <= p * v[i]) {
				tmp = j - i + 1;
				if (tmp > final)final = tmp;
			}
			else break;
		}
	}
	cout << final;
	return 0;
}