uva 1267

首先要看清题，tree，这样可以省很多麻烦。建立站点的时候，从离树根最远的地方开始计算k倍关系。

#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
const int maxn = 1000 + 5;
vector<int> gr[maxn];
vector<int> nodes[maxn];
int fa[maxn], covered[maxn];
int n, s, k;
void dfs1(int u, int f, int d)
{
    fa[u] = f;
    int nc = gr[u].size();
    if(nc == 1 && d > k) nodes[d].push_back(u);
    for(int i = 0; i < nc; i++)
    {
        int v = gr[u][i];
        if(v != f)
            dfs1(v, u, d + 1);
    }
}
void dfs2(int u, int f, int d)
{
    covered[u] = 1;
    int nc = gr[u].size();
    for(int i = 0; i < nc; i++)
    {
        int v = gr[u][i];
        if(v != f && d < k)
        {
            dfs2(v, u, d + 1);
        }
    }
}
int solve()
{
    memset(covered, 0, sizeof(covered));
    int ans = 0;
    for(int i = n - 1; i > k; i--)
    {
        for(int j = 0; j < nodes[i].size(); j++)
        {
            int u = nodes[i][j];
            if(covered[u]) continue;
            int v = u;
            for(int d = 0; d < k; d++) v = fa[v];
            dfs2(v, -1, 0);
            ans++;
        }
    }
    return ans;
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        memset(fa, 0, sizeof(fa));
        scanf("%d%d%d", &n, &s, &k);
        for(int i = 0; i <= n; i++)
        {
            gr[i].clear();
            nodes[i].clear();
        }
        for(int i = 0; i < n - 1; i++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            gr[a].push_back(b);
            gr[b].push_back(a);
        }
        dfs1(s, -1, 0);
        printf("%d\n", solve());
    }
    return 0;
}