Python实现Pat 1085. Perfect Sequence (25)

最新推荐文章于 2019-02-24 14:49:48 发布

原创最新推荐文章于 2019-02-24 14:49:48 发布 · 374 阅读

0 ·

CC 4.0 BY-SA版权

python 同时被 2 个专栏收录

47 篇文章

订阅专栏

pat

33 篇文章

订阅专栏

本文介绍了一个算法问题：如何从一组正整数中找到尽可能多的数形成“完美子序列”。这里，完美子序列定义为最大值与最小值之比不超过给定参数p的序列。文章提供了具体的输入输出规范及一个示例性的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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 (<= 105) is the number of integers in the sequence, and p (<= 109) is the parameter. In the second line there are N positive integers, each is no greater than 109.

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,p = [int(x) for x in input().split(' ')]
nums=[int(x) for x in input().split(' ')]
nums.sort()
low=0
up=1
maximum =1
for low in range(N-1):
    while(up<N):
        if nums[up]<=nums[low]*p:
            up+=1
        elif up-low>maximum:
            maximum=up-low
        else:
            break
print (maximum)