PAT-A1085. Perfect Sequence (25)

排序后twopointer做的。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;

#define MAX 100000+10
int a[MAX];

int cmp(const void *a, const void *b)
{
  return *(int*)a - *(int*)b;
}

int main()
{
  //freopen("in.txt", "r", stdin);
  //freopen("out.txt", "w", stdout);
  int N = 0, p = 0;
  scanf("%d %d", &N, &p);
  for (int i = 0; i < N; i++)
    scanf("%d", &a[i]);
    
  qsort(a, N, sizeof(int), cmp);
  int i = 0, j = 0, count = 1;
  while (i < N && j < N)
  {
    while (j < N && a[j] <= (long long )a[i]*p)
    {
      count = max(count, j-i+1);
      j++;
    }
    i++;
  }
  
  printf("%d", count);
  return 0;
}