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 (≤105) is the number of integers in the sequence, and p (≤109) is the parameter. In the second line there are N positive integers, each is no greater than 109.

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<algorithm>
using namespace std;
int main()
{
    int N,p,temp;
    long long int num[100010];
    scanf("%d%d",&N,&p);
    for(int i=0;i<N;i++)
        scanf("%lld",num+i);
    sort(num,num+N);
    int left=0,right=0,Max_len=1,len=0;
    while(right<N)
    {
        if(num[right]<=num[left]*p)
        {
            right++;
            len++;
        }
        else
        {
            left++;
            Max_len=Max_len>=len?Max_len:len;
            len--;
        }
    }
    Max_len=Max_len>=len?Max_len:len;
    printf("%d",Max_len);
    return 0;
}