uva 1456 - Cellular Network 蜂窝网络 概率DP

题目：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4202

/**==========================================
 *   This is a solution for ACM/ICPC problem
 *
 *   @source£ºuva 1456 - Cellular Network
 *   @type:  dp
 *   @author: wust_ysk
 *   @blog:  http://blog.csdn.net/yskyskyer123
 *   @email: 2530094312@qq.com
 *===========================================*/
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF =0x3f3f3f3f;
const int maxn=100    ;
//const int maxV=12    ;
int T,n,w;
int a[maxn+5];
double dp[maxn+5][maxn+5];
bool cmp(double x,double y)
{
    return x>y;
}
int tot;
double get(int num,int x)
{
    int ans=0;
    for(int i=x;i<x+num;i++)
    {
        ans+=a[i];
    }
    return ans*1.0/tot;
}
int main()
{
    scanf("%d",&T);

    while(T--)
    {
        scanf("%d%d",&n,&w);
        tot=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]),tot+=a[i];
        }
        sort(a+1,a+1+n,cmp);

        for(int i=1;i<=n;i++)  dp[0][i]=INF;/**double do not use memset 0x3f**/
        dp[0][0]=0;/**if for i=1...n dp[0][i]=0  will be wrong **/

        for(int ind=1;ind<=w;ind++)
        {
            for(int ed=ind;ed<=n;ed++)
            {
                dp[ind][ed]=INF;
               for(int k=ind-1;k<ed;k++)
               {
                   int num=ed-(k+1)+1;
                   dp[ind][ed]=min(dp[ind][ed], dp[ind-1][k]+ed*get(num,k+1) );
               }
            }
        }



        printf("%.4f\n",dp[w][n]);


    }

   return 0;
}

/*
2
5 2
30 5 10 30 25
5 5
30 5 10 30 25

*/