pat-a1085. Perfect Sequence (25)

这个题原意是对每个数，在另一个范围内二分查找一个数找到最大长度

我翻看了一下我之前写过的basic里面的这个题，其实用暴力也能过。每次直接在已经找到的最大距离之外去找也能

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long int num[100001];
int main()
{
	long int n,p;
	scanf("%ld%ld",&n,&p);
	for(int i=0;i<n;++i)
	 scanf("%ld",&num[i]);
	sort(num,num+n);
	int ans=1;
	for(int i=0;i<n;++i)
	 for(int j=i+ans;j<n;++j)
	 {
	 	if(num[i]*p>=num[j])
	 	{
	 		if(j-i+1>ans)  ans=j-i+1;
	 	}
	 	else break;
	 } 
	printf("%d\n",ans);
	return 0;
}

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