1085. Perfect Sequence (25)

1. 原题： https://www.patest.cn/contests/pat-a-PRactise/1085

2. 思路：

3. 源码：

#include<iostream>#include<algorithm>//使用sort函数#include<vector>using namespace std;typedef long long int lint;int main(void){	//freopen("in.txt", "r", stdin);	lint N, p;	cin >> N >> p;	vector<lint> seq(N);//存储元素	for (int i = 0; i < N; i++)		cin >> seq[i];	sort(seq.begin(), seq.end());//升序	int m = 0, num;//分别为起始位置， 元素个数	int M = 0, cnt = 0;//分别为终点位置， 最大个数	while (m < N)//循环	{		lint range = seq[m] * p;//满足条件的元素最大值		while (M < N && seq[M] <= range)			M++;		num = M - m;		cnt = max(cnt, num);//更新最大个数		if (M == N)//已到序列末尾，跳出			break;		else			m++;	}	cout << cnt << endl;	return 0;}