[bzoj2428]均分数据

[bzoj2428]均分数据

---

模拟退火

• 代码

#include<bits/stdc++.h>
using namespace std;
typedef double db;
db a[100],ave;
int id[100];
db sum[100];
int n,m;
inline db solve(){
    db T=10000;
    db ans=0,pst=0;
    for(int i=0;i<m;i++)sum[i]=0;
    for(int i=1;i<=n;i++){id[i]=rand()%m;sum[id[i]]+=a[i];}
    for(int i=0;i<m;i++)ans+=(sum[i]-ave)*(sum[i]-ave);
    for(;T>=0.1;T*=0.85){
        pst=ans;
        int x=rand()%n+1,y=0;
        if(T<500)
            y=rand()%m;
        else
            for(int i=0;i<m;i++)if(sum[i]<sum[y])y=i;
        ans+=a[x]*(a[x]+sum[y]-sum[id[x]])*2;
        if(ans>pst && T<rand()%10000)ans=pst;
        else {
            sum[id[x]]-=a[x],sum[y]+=a[x],id[x]=y;
        }
    }
    return ans;
}

int main()
{
    srand(20030102);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%lf",&a[i]);ave+=a[i];
    }
    random_shuffle(a+1,a+n+1);
    ave/=m;
    db ans=1e100;int T=50000;
    while(T--)ans=min(ans,solve());
    printf("%.2f\n",sqrt(ans/m));
    return 0;
}