PAT 甲级 1085 Perfect Sequence (25 分)

最新推荐文章于 2022-04-16 15:07:05 发布

编程龙

最新推荐文章于 2022-04-16 15:07:05 发布

阅读量117

点赞数

分类专栏： PAT编程文章标签： c语言算法

本文链接：https://blog.csdn.net/qq_45478482/article/details/120097264

版权

PAT编程专栏收录该内容

97 篇文章 0 订阅

订阅专栏

题目描述

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.

输入

Each input file contains one test case. For each case, the first line contains two positive integers N and p, where N $10^5)$ is the number of integers in the sequence, and p $10^9)$ is the parameter. In the second line there are N positive integers, each is no greater than $10^9$

输出

For each test case, print in one line the maximum number of integers that can be chosen to form a perfect subsequence.

思路

先从小到达排序，从第0个开始，如果该子串最后一个和第一个满足题目描述，j++否则i++。每次弄完判断一下max

代码

#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
long long ans[100010];
int main()
{
	long long N, p;
	cin >> N >> p;
	for (int i = 0; i < N; i++)
	{
		cin >> ans[i];
	}
	sort(ans, ans + N);
	int i = 0;
	int j = 0;
	long long maxAll = 1;
	long long cur_all = 0;
	while (1)
	{
		if (j == N)
		{
			break;
		}
		if (ans[i] * p >= ans[j])
		{
			j++;
			cur_all++;
		}
		else
		{
			i++;
			cur_all--;
		}
		if (cur_all > maxAll)
		{
			maxAll = cur_all;
		}
	}
	printf("%lld\n", maxAll);
}