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<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
using namespace std;
int n, p;
vector<int> num;
vector<int> icl;
int main() {
	cin >> n >> p;
	num.resize(n + 1);
	for (int i = 0; i < n; i++) {
		cin >> num[i];
	}
	sort(num.begin(), num.begin() + n);
	int min, max;
	int maxcnt = 0;
	for (int i = 0; i < n; i++) {
		if (n - i >= maxcnt) {
			min = num[i];
			max = num[i] * p;
			for (int j = i; j < n; j++) {
				if (num[j] >= min&&num[j] <= max) icl.push_back(num[j]);
			}
			if (icl.size() > maxcnt) maxcnt = icl.size();
			icl.clear();
		}
		else break;
	}
	cout << maxcnt;
	return 0;
}