1085. Perfect Sequence (25)

//方法2#include<cstdio>#include<algorithm>using namespace std;int maxn[100010];int main(){  int n=0,p=0;  scanf("%d%d",&n,&p);  int i=0;  for(i=0; i<n; i++)    scanf("%d",&maxn[i]);  sort(maxn, maxn+n);  int ans = 1;  for(i=0; i<n; i++)  {    int j = upper_bound(maxn+i+1,maxn+n,(long long)maxn[i]*p) - maxn;    ans = max(ans, j-i);  }  printf("%d",ans);  return 0;}