PAT (Advanced Level) Practise 1085-Perfect Sequence (25)
来源:互联网 发布:越国以鄙远 君知其难也 编辑:程序博客网 时间:2024/06/07 02:12
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
题意:给你n个数,让你取出尽量多的数,使得这些数中的最大值ma,最小值mi满足ma<=mi*p
解题思路:将数字排序后暴力每个数作为最小值,二分查询最大值的位置
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;LL a[100005],p;int n;int main(){ while(~scanf("%d%lld",&n,&p)) { for(int i=1;i<=n;i++) scanf("%lld",&a[i]); sort(a+1,a+1+n); int ma=-1; for(int i=1;i<=n;i++) { int k=upper_bound(a+i,a+1+n,a[i]*p)-a-1; ma=max(k-i+1,ma); } printf("%d\n",ma); } return 0;}
- PAT (Advanced Level) Practise 1085 Perfect Sequence (25)
- PAT (Advanced Level) Practise 1085-Perfect Sequence (25)
- Pat(Advanced Level)Practice--1085(Perfect Sequence)
- 【PAT】【Advanced Level】1085. Perfect Sequence (25)
- 1085. Perfect Sequence (25)【二分查找】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1051 Pop Sequence (25)
- PAT (Advanced Level) Practise 1051 Pop Sequence (25)
- PAT Advanced Level 1085. Perfect Sequence (25)(Java and C++)
- PAT (Advanced Level) 1085. Perfect Sequence (25) 贪心算法
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- Android学习笔记之BitmapFactory.Options实现图片资源的加载...
- 什么是web应用程序
- php PDO mysql问题解决
- 通过Windows任务管理器关闭运行的jar
- 数组,父子数组删除相同项
- PAT (Advanced Level) Practise 1085-Perfect Sequence (25)
- left join on
- Centos 7下搭建SS
- 棋牌公司简介
- 搭建多节点的私链
- 44 《创新公司:皮克斯的启示_下》 -豆瓣评分8.7
- 【机器学习 Opencv】Opencv之Bag of Word模型(一)
- android studio adb打不开的解决方法
- C++ 引用和指针