uva 1354 Mobile Computing

There is a mysterious planet called Yaen, whose space is 2-dimensional. There are many beautiful
stones on the planet, and the Yaen people love to collect them. They bring the stones back home and
make nice mobile arts of them to decorate their 2-dimensional living rooms.
In their 2-dimensional world, a mobile is defined recursively as follows:
• a stone hung by a string, or
• a rod of length 1 with two sub-mobiles at both ends; the rod is hung
by a string at the center of gravity of sub-mobiles. When the weights
of the sub-mobiles are n and m, and their distances from the center
of gravity are a and b respectively, the equation n × a = m × b holds.
For example, if you got three stones with weights 1, 1, and 2, here are some possible mobiles and
their widths:
Given the weights of stones and the width of the room, your task is to design the widest possible
mobile satisfying both of the following conditions.
• It uses all the stones.
• Its width is less than the width of the room.
You should ignore the widths of stones.
In some cases two sub-mobiles hung from both ends of a rod
might overlap (see the figure on the right). Such mobiles are acceptable.
The width of the example is (1/3) + 1 + (1/4).
Input
The first line of the input gives the number of datasets. Then the specified number of datasets follow.
A dataset has the following format.
r
s
w1
ws
r is a decimal fraction representing the width of the room, which satisfies 0 < r < 10. s is the number
of the stones. You may assume 1 ≤ s ≤ 6. wi
is the weight of the i-th stone, which is an integer. You
may assume 1 ≤ wi ≤ 1000.
You can assume that no mobiles whose widths are between r−0.00001 and r+ 0.00001 can be made
of given stones.
Output
For each dataset in the input, one line containing a decimal fraction should be output. The decimal
fraction should give the width of the widest possible mobile as defined above. An output line should
not contain extra characters such as spaces.
In case there is no mobile which satisfies the requirement, answer ‘-1’ instead.
The answer should not have an error greater than 0.00000001. You may output any numb er of
digits after the decimal point, provided that the ab ove accuracy condition is satisfied.

Sample Input

对于这种题像我这种水笔是还是不会的，看书上的分析才出了这种最笨的方法：（等待完善.....）

<span style="font-family:Arial;">#include <iostream>
#include<string.h>
#include<stdio.h>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
using namespace std;
struct node
{
    double z,y;
    int w;
} a[15];
int n;
double R,mim;
void dfs(node tree[],int tot)
{
    int w,k;
    double z,y,q,p;
    if(tot==n-1)//枚举完一种情况，判断是否最优解
    {
        if(mim<tree[1].z+tree[1].y) mim=tree[1].z+tree[1].y;
    }
    else
    {
        node *newtree =(node*)malloc(sizeof(node)*(n-tot));//为下一次dfs，新建集合。
        for(int i=1; i<=n-tot; i++)//枚举现集合所以的组合。
        {
            for(int j=i+1; j<=n-tot; j++)
            {
                w=tree[i].w+tree[j].w;
                k=1;
                for(int r=1; r<=n-tot; r++)//给新集合赋值
                {
                    if(r!=i&&r!=j)
                    {
                        newtree[k].z=tree[r].z, newtree[k].y=tree[r].y, newtree[k].w=tree[r].w;
                        k++;
                    }
                }
                q=(double)tree[j].w*1.0/w,p=(double)tree[i].w*1.0/w;
                //i放左 j放右//组合成的新树
                newtree[k].w=w;//组合树的重量w
                z=q+tree[i].z, y=p+tree[j].y;//组合树的新左右长度大小
                z=(z>(tree[j].z-p)? z:(tree[j].z-p)), y=(y>(tree[i].y-q)? y:(tree[i].y-q));//特殊情况
                newtree[k].z=z,  newtree[k].y=y;
                if(newtree[k].z+newtree[k].y<=R)
                    dfs(newtree,tot+1);
                //-------------------------------------------------------------------------
                //j放左 i放右//组合成的新树
                z=p+tree[j].z,y=q+tree[i].y;
                z=(z>(tree[i].z-q)? z:(tree[i].z-q)), y=(y>(tree[j].y-p)? y:(tree[j].y-p));
                newtree[k].z=z ,  newtree[k].y=y;
                if(newtree[k].z+newtree[k].y<=R)
                    dfs(newtree,tot+1);
            }
        }
        free(newtree);
    }
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        scanf("%lf %d",&R,&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i].w);
        for(int i=1; i<=n; i++)
        {
            a[i].z=0,a[i].y=0;
        }
        mim=-1;
        dfs(a,0);
        if(mim==-1) printf("-1\n");
        else
            printf("%.16lf\n",mim);
    }
    return 0;
}
</span>