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 9Sample Output:
8
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
int main(){
freopen("F://Temp/input.txt", "r", stdin);
int N, p;
cin >> N >> p;
long long *input = new long long[N];
for (int i = 0; i < N; ++i){
cin >> input[i];
}
sort(input, input + N);//排序
int max = 1;
int cur_count = 2;
int idx_t = 1;
int idx_s = 0;
for (; idx_s < N - 1; ++idx_s){
--cur_count;
for (; idx_t < N; ++idx_t){
if (input[idx_t] <= input[idx_s] * p)
++cur_count;
else{
break;
}
}
if (cur_count > max)max = cur_count;
}
cout << max << endl;
return 0;
}