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 Mand 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()
{
	//freopen("in.txt", "r", stdin);
	int n, ans = 0, temp = 0;
	long long p;
	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 + ans; j < n; j++)//因为是为了了找最⼤的ans，所以下一次j只要从i的ans个后⾯面开始找就⾏了
		{
			if (v[i] * p >= v[j])
			{

				temp = j - i + 1;
				/*if (temp>ans)
				{
					ans = temp;
				}*/
				ans = temp > ans ? temp : ans;
			}
			else
			{
				break;
			}
		}
	}
	cout << ans;
	return 0;
}