1085. Perfect Sequence

最新推荐文章于 2022-10-18 08:28:07 发布

sky247391475

最新推荐文章于 2022-10-18 08:28:07 发布

阅读量623

点赞数

分类专栏： PAT 文章标签： PAT C++

本文链接：https://blog.csdn.net/sky247391475/article/details/52794605

版权

PAT 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

1085. Perfect Sequence (25)

时间限制

300 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CAO, Peng

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:

脑袋不清醒就会卡。。。二分查找怎么都写不对了，最后终于想好了，所有结束的down都指向满足条件的第一个下标。

最小值的下标从0开始循环，用二分查找找最大值，判断的条件是最小值和最大值除以p的值比较，注意相等的有余数的不同情况。

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

int main()
{
	int n,p;
	cin>>n>>p;
	vector<int>s(n);
	for(int i=0;i<n;++i)
		cin>>s[i];
	sort(s.begin(),s.end());
	int maxl=1;
	for(int i=0;i<n;++i)
	{
		int up=n-1;
		int down=i;
		int mid=(up+down)/2;			
		if(s[i]>s[n-1]/p)
		{
			if(maxl<n-i)
				maxl=n-i;
			break;
		}
		while(up>=down)
		{
			mid=(up+down)/2;
			if(s[i]<s[mid]/p)
				up=mid-1;
			else if(s[i]>s[mid]/p)
				down=mid+1;
			else
			{
				down=mid;
				if(s[mid]%p==0)		
					while(down+1<n&&s[i]==s[down+1]/p&&s[down+1]%p==0)
						down++;
				else
					while(down-1>=i&&s[i]==s[down]/p&&s[down]%p!=0)
						down--;
				down++;
				break;
			}
		}
		if(maxl<down-i)
			maxl=down-i;		
	}
	cout<<maxl;
	return 0;
}