[期望 数学] BZOJ 2720 [Violet 5]列队春游

枚举每个小朋友i  位置x 贡献 j

可以发现 x 对 求答案无用 可以优化到O(n2)

懒得优化啦

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long double ld;  

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=305;

int sx[N],icnt;

inline int Bin(int x){
	return lower_bound(sx+1,sx+icnt+1,x)-sx;
}

int n,a[N];
ld fac[N][N],ans;

inline void Pre()
{
	fac[0][0]=1;  
    for (int i=1;i<=n;i++){  
        fac[i][0]=1;  
        for (int j=1;j<=i;j++)  
            fac[i][j]=fac[i][j-1]*(i-j+1);  
    }
}

int main()
{
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n);
	for (int i=1;i<=n;i++)
		read(a[i]),sx[++icnt]=a[i];
	sort(sx+1,sx+icnt+1); 
	for (int i=1;i<=n;i++) a[i]=Bin(a[i]);
	Pre();
	for (int i=1;i<=n;i++)
	{
		for (int x=1;x<=n;x++)
		{
			for (int j=1;j<x;j++)
				ans+=fac[a[i]-1][j-1]*(n-a[i])*j/fac[n][j+1];
			ans+=fac[a[i]-1][x-1]*x/fac[n][x];
		}
//		printf("%.2lf\n",(double)ans);
	}
	printf("%.2lf\n",(double)ans);
	return 0;
}

 UPD：线性做法

#include<cstdio>
int i,n,s,x,c[1001]; 
double ans;
int main(){
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	scanf("%d",&n); 
	for (i=1;i<=n;i++) scanf("%d",&x),c[x]++; n++;
	for (i=0;i<=1000;i++)
		if (c[i])
			ans+=1.0*c[i]*n/(n-s),s+=c[i];
	printf("%.2lf\n",ans);
}

证明：