PTA甲级考试真题练习85——1085 Perfect Sequence

题目

思路

排序题

代码

#include <iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<long long> vec;
int main()
{
	int n, p;
	cin >> n >> p;
	vec.resize(n);
	for (int i = 0; i < n; ++i)
		cin >> vec[i];
	sort(vec.begin(), vec.end());
	int maxwidth = 0;
	int _index = 1;
	for (int i = 0; i < n; ++i) {
		long long num = vec[i] * p;
		while (_index < n && vec[_index] <= num) ++_index;
		maxwidth = max(maxwidth, _index-i);
        if (_index >= n)
			break;
	}
	cout << maxwidth;
	return 0;
}