PAT(Basic Level)_1030_完美数列
2017-07-25 10:23
260 查看
#include<cstdio> #include<algorithm> using namespace std; int main(){ int i,j; int N; scanf("%d",&N); double p; scanf("%lf",&p); int nums[100000]; for(i=0;i<N;i++){ scanf("%d",nums+i); } sort(nums,nums+N); for(j=N-1;nums[j]>nums[0]*p;j--); int max=++j; for(i=0;i<N;i++){ while(nums[j]<=nums[i]*p && j<N) j++; if(j-i>max) max=j-i; } printf("%d",max); return 0; }
相关文章推荐
- Pat(Basic Level)Practice--1030(完美数列)
- PAT(basic level) 1030 完美数列(25)
- PAT(Basic Level) 完美数列(25)
- PAT (Basic Level) Practise (中文)1030. 完美数列(25)
- PAT (Basic Level) Practise (中文)1030. 完美数列(25)
- PAT (Basic Level) Practise:1030. 完美数列
- PAT BASIC LEVEL 1030. 完美数列(25)
- PAT乙级(Basic Level)真题 >完美数列
- PAT (Basic Level) Practise (中文) 1030. 完美数列(25)
- PAT (Basic Level)1030. 完美数列
- PAT (Basic Level) Practise (中文)-1030. 完美数列(25)
- PAT_乙级 1030 完美数列
- PAT乙级1030 完美数列
- PAT basic-level 1030 完美数列 笔记
- PAT1030完美数列(25)
- PAT乙级1030完美数列
- PAT1030 完美数列(25)
- PAT 乙等 1030 完美数列
- PAT (Basic Level)1049. 数列的片段和
- PAT(Python)-1030:完美数列(25)