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

坑点 ：请使用long long 代替 int，最后一个节点会超范围

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
    
    long long int n, p;
    cin >> n >> p;
    vector<long long int> vec(n);
    for(long long int i = 0; i < n; i++){

        scanf("%lld", &vec[i]);
    }
    sort(vec.begin(), vec.end());

    long long int cnt = 0;
    long long int max_index = 0;
    for(long long int i = 0; i < n; i++){

        while (vec[max_index] <= vec[i] * p && max_index < n)
        {
            max_index++;
               
        }
        cnt = max(cnt, max_index - i);
        if(max_index >= n){
            cout << cnt << endl;
            return 0;
        } 


    }


    return 0;
}