PAT甲级1085 Perfect Sequence (25 分)

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

结尾无空行

是部分序列~不是一定要从最小开始~

乘积可能会溢出，所以要longlong~

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

int main()
{
    int len;
    long long p;
    cin>>len>>p;
    vector<long long> vec;
    for(int i=0;i<len;i++)
    {
        long long num;
        cin>>num;
        vec.push_back(num);
    }
    sort(vec.begin(),vec.end());
    int res=0;
    for(int i=0;i<len;i++)
    {
        int temp=0;
        for(int j=i+res;j<len;j++)
        {
            if(vec[j]<=vec[i]*p)
            {
                temp=j-i+1;
                if(temp>res)
                    res=temp;
            }
            else
                break;
        }
    }

    cout<<res<<endl;
    return 0;
}