PAT A 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⁵) 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

 

n*log(n)的方法：

1、排序；

2、记录序列的头、尾，向后扫描：

  2.1、如果尾小于等于头的p倍，尾向后；

  2.2、否则，头向后；

 

代码：

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

int main()
{
	int n,p,i=0;	//n,p
	long long templl;	//临时数据
	vector<long long> seq;	//序列
	cin>>n>>p;	//输入
	for(i=0;i<n;i++)
	{
		cin>>templl;
		seq.push_back(templl);
	}
	sort(seq.begin(),seq.end());	//排序
	int max=0,begin=0,end=0;	//最大的长度，当前范围的头，超尾
	while(end<n)	//从头到尾扫描
	{
		templl=seq[begin]*p;
		while(end<n&&seq[end]<=templl)
			end++;
		if(max<end-begin)
			max=end-begin;
		begin++;
	}
	cout<<max;	//输出结果

	return 0;
}