求树的直径

        for (int mask = 3; mask <= (1 << n) - 1; mask++) { //所有子集
            int vis = 0;
            int res = 0;
            if ((mask & (mask - 1)) == 0) continue;//至少有两个点

            function<int(int)>dfs = [&](int i)->int{ //计算树的直径
                vis |= (1 << i);
                int maxlen = 0, sec = 0;
                for (int j : g[i]) {
                    if ((vis >> j & 1) == 0 && (mask >> j & 1)) {
                        int d = dfs(j);
                        if (d > maxlen) {
                            sec = maxlen;
                            maxlen = d;
                        } else if (d > sec) {
                            sec = d;
                        }
                    }
                }
                res = max(res, ma + sec);
                return ma + 1;
            };

            dfs(__builtin_ctz(mask));

            if (vis == mask)ans[res - 1]++;

        }



        return ans;
    }


};