Codeforces 626E Simple Skewness(暴力枚举+二分)

目录

• 题意
• 分析

 

E. Simple Skewness

time limit per test:3 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with repetition) with the maximum simple skewness.

The mean of a collection is the average of its elements. The median of a collection is its middle element when all of its elements are sorted, or the average of its two middle elements if it has even size.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of elements in the list.

The second line contains n integers x_i (0 ≤ x_i ≤ 1 000 000) — the ith element of the list.

Output

In the first line, print a single integer k — the size of the subset.

In the second line, print k integers — the elements of the subset in any order.

If there are multiple optimal subsets, print any.

Examples

Input

4
1 2 3 12

Output

3
1 2 12 

Input

4
1 1 2 2

Output

3
1 1 2 

Input

2
1 2

Output

2
1 2

Note

In the first case, the optimal subset is , which has mean 5, median 2, and simple skewness of 5 - 2 = 3.

In the second case, the optimal subset is . Note that repetition is allowed.

In the last case, any subset has the same median and mean, so all have simple skewness of 0.

题目链接：http://codeforces.com/contest/626/problem/E

Return Top

题意

给出n个数的集合，求一个 （平均数-中位数）最大 (偏度最大)的子集，输出子集元素个数和各个元素（任意顺序）。

Return Top

分析

因为是子集，所以不一定是连续的序列。然后我们有下面几个结论。

1.最大偏度一定≥0

因为一个元素时，偏度为0。

2.最大偏度子集必定有元素个数为奇数个的。

证：

如果当元素个数是偶数2*k时偏度最大，我们证明它去掉一个元素a[k+1]不会更差。

子集里排好序分别是a[i]。除去a[k+1]其它数的平均值为av

新平均值-旧平均值=av-(av+a[k+1])/2=(av-a[k+1])/2

新中位数-旧中位数=a[k]-(a[k]+a[k+1])/2=(a[k]-a[k+1])/2

且有 旧平均值-旧中位数=(av+a[k+1])/2-(a[k]+a[k+1])/2=(av-a[k])/2≥0 （否则不可能偏度最大）

所以有 平均值增量-中位数增量=(av-a[k])/2≥0

所以新的偏度肯定不会更差。

3.平均值先递增后递减

因为是奇数个，所以枚举每个数做中位数，假如左右延伸长度为j，那么要使偏度更大，我们一定是每次选剩下的里面左边最大和右边最大的数。所以剩下的数越来越小，平均值增加得越来越少，而当前平均值越来越大，到某个峰值后平均值就开始减小了。

所以可以用二分法每次取中点和中点旁边一个点判断当前平均值在增加还是减小，增加就往右找，减小就往左找。

顺便吐槽一句：cf测评机不行啊，跑这个跑了大半个小时才跑完！！！

 

下面给出AC代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200020;
inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}
int n;
ll s[N<<1],a[N<<1];
int ansi=1,ansp;
double ans;
//最大偏度≥0，所以初始值就是只有第一个元素，偏度为0
ll sum(int i,int j)
{
    return s[n]-s[n-j]+s[i]-s[i-j-1];
}
int main()
{
    n=read();
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
    {
        s[i]=s[i-1]+a[i];
    }
    for(int i=2;i<n;i++)
    {
        int l=1,r=min(i-1,n-i),m;
        ll s1,s2;
        while(l<r)
        {
            int mid=(l+r)/2;
            s1=sum(i,mid)*(2*mid+3);
            s2=sum(i,mid+1)*(2*mid+1);
            if(s1>s2)
            {
                r=mid;
            }
            else
            {
                l=mid+1;
                if(s1==s2)
                    break;
            }
        }
        if(1.0*sum(i,l)/(2*l+1)-a[i]>ans)
        {
            ans=1.0*sum(i,l)/(2*l+1)-a[i];
            ansi=i;
            ansp=l;
        }
    }
    cout<<ansp*2+1<<endl;
    cout<<a[ansi]<<" ";
    for(int i=1;i<=ansp;i++)
    {
        cout<<a[ansi-i]<<" "<<a[n-i+1]<<" ";
    }
    cout<<endl;
    return 0;
}