接上uva1354 用二进制枚举

copy刘汝佳的模板...不解释了...水平差...

#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn = 6;

struct Tree{
    double L,R;
    Tree():L(0),R(0){}
};

bool visit[1< tree[1<0;left=(left-1)&subnet)
    {
        hasChild = true;
        int right = subnet^left;
        printf("subnet:%d left:%d right:%d\n",subnet,left,right);
        dfs(left); dfs(right);
        double l = sum[right]/sum[subnet];
        double r = sum[left]/sum[subnet];
        for(int i=0;i

你可能感兴趣的:(接上uva1354 用二进制枚举)