分析:
首先排序不会影响题目的求解,尝试排序找解法。
1.首先找满足条件的最大长度
可以发现,本题满足条件的序列长度具有单调性,对于满足最大长度为M的结果序列,当我们减去最小值后,最大值不变,平均值变大,显然长度为M-1也成立,所以具有单调性可二分求最大长度。
2.求出满足最大长度的区间
可以贪心的想,我们要sum尽可能的大,那么对于最大值已经固定满足最大长度len条件的序列,我们一定会小于最大值的len-1个数,然后找最小数可以选到哪,因为已经排好序所以可以二分找。
check条件:p * sum >= len * q * max
代码如下:
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N = 2e5 + 10;
PII a[N];
LL Max,s[N],p,q,b[N];
int vis[N];
int mcnt,n;
void add(int l,int r,int k)
{
vis[l] += k;
vis[r + 1] -= k;
}
int work1(int maxs,int k)
{
int right = k;
int r = k, l = 1;
while(l < r)
{
int mid = (l + r) >> 1;
LL x1 = (s[right] - s[mid - 1]) * p;
LL x2 = (LL)(right - mid + 1) * maxs * q;
if(x1 >= x2) r = mid;
else l = mid + 1;
}
int cnt = right - l + 1;
return cnt;
}
bool cal(int pos, int m)
{
if(pos - m + 1 >= 0){
LL x1 = (s[pos] - s[pos - m]) * p;
LL x2 = (LL)m * (LL)a[pos].first * q;
if(x1 >= x2) return true;
else return false;
}
return false;
}
void work2(int pos,int m)
{
int l = 1,r = pos - m + 1;
LL sum = s[pos] - s[r - 1];
sum -= a[r].first;
while(l < r)
{
int mid = (l + r) >> 1;
LL x1 = (LL)(sum + a[mid].first) * p;
LL x2 = (LL)m * (LL)a[pos].first * q;
if(x1 >= x2) r = mid;
else l = mid + 1;
}
add(l,pos,1);
}
int main()
{
scanf("%d",&n);
for(int i = 1; i <= n; i ++ )
{
int x;
scanf("%d",&x);
a[i] = {x,i};
}
scanf("%lld %lld",&p,&q);
sort(a + 1,a + 1 + n);
for(int i = 1; i <= n; i ++ ){
s[i] = s[i - 1] + (LL)a[i].first;
}
mcnt = 1;
for(int i = n; i >= 1; i -- ){
Max = (double)a[i].first;
mcnt = max(mcnt,work1(Max,i));
}
for(int i = n; i >= 1; i -- ){
if(cal(i,mcnt)){
work2(i,mcnt);
}
}
vector<int> res;
for(int i = 1; i <= n; i ++ ){
b[i] = vis[i] + b[i - 1];
if(!b[i]) res.push_back(a[i].second);
}
sort(res.begin(),res.end());
int sz = res.size();
printf("%d\n",sz);
for(int i = 0; i < sz; i ++ ) printf("%d ",res[i]);
return 0;
}