1085. Perfect Sequence (25)
来源:互联网 发布:淘宝实拍保护原理 编辑:程序博客网 时间:2024/06/14 00:06
1085. Perfect Sequence (25)
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 82 3 20 4 5 1 6 7 8 9Sample Output:
8
提交代码
题目意思:
给定一个正整数数列,和正整数p,设这个数列中的最大值是M,最小值是m,如果M <= m * p,则称这个数列是完美数列。
现在给定参数p和一些正整数,请你从中选择尽可能多的数构成一个完美数列。
输入格式:
输入第一行给出两个正整数N和p,其中N(<= 105)是输入的正整数的个数,p(<= 109)是给定的参数。第二行给出N个正整数,每个数不超过109。
输出格式:
在一行中输出最多可以选择多少个数可以用它们组成一个完美数列。
注意:M不一定是里面最大的数,可以是任意数,题目是要我们选出一些数,而不是所有数#include<cstdio>#include<algorithm>using namespace std;#define N 100005int main(){int n,p,a[N];//freopen("input.txt","r",stdin);scanf("%d%d",&n,&p);for(int i = 0;i < n;i++){scanf("%d",&a[i]);}sort(a,a+n);int ans = 1;for(int i = 0;i < n;i++){int index = upper_bound(a+i+1,a+n,(long long)a[i]*p) - a;ans = max(ans,index - i);if(ans > n-i){break;}}printf("%d\n",ans);return 0;}
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)
- java工厂模式的理解
- 数据结构<一> 排序算法之插入排序
- No 'Access-Control-Allow-Origin' header is present on the requested resource. Origin
- java虚拟机 GC垃圾回收
- java多线程与多核心测试
- 1085. Perfect Sequence (25)
- Ubuntu上安装wine进行apt-get update时遇到的问题
- vim 插件 (安装 and 用法)
- Android使用ShareSDK实现微信第三方登录中要获取unionid的方法
- java应用MongoDB简单操作
- Ones and Zeroes 问题及解法
- LightOJ 1094 Farthest Nodes in a Tree(dfs)
- getopt、getopt_long和getopt_long_only
- C# 钉钉api接口开发(三) 免登录及自动刷新AccessToken