2019 CCPC Final K - Russian Dolls on the Christmas Tree

2019 CCPC Final K - Russian Dolls on the Christmas Tree

题目大意：

给你一颗以$1$为根节点的树，求以每个节点为根节点的子树上有多少连续的区间

基本思路：

发现如果不合并，对应子树的答案为该子树的节点数量，若有$k，k+1$ 在某一个子树内，则该子树的答案减少$1$。故可以处理出每个$k,k+1$ 的$lca$,使$lca$节点到根节点的答案减$1$。

小技巧：先不用处理子树结点个数，求出$lca$更新$ans[]$之后进行$dfs$ 求子树大小可以避免超时

代码：

#include <bits/stdc++.h>
using namespace std;
#define Paddi ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
const int N = 2e5 + 10;
vector<int> e[N];
int ans[N];
int n;
int dep[N], fa[N][22];
void init()
{
    for (int i = 0; i <= n + 5; i++)
        e[i].clear(), ans[i] = 0, dep[i] = 0;
}
void dfs(int x, int f)
{
    dep[x] = dep[f] + 1;
    fa[x][0] = f;
    for (int i = 1; i <= 20; i++)
        fa[x][i] = fa[fa[x][i - 1]][i - 1];
    for (int i = 0; i < e[x].size(); i++)
    {
        if (e[x][i] != f)
            dfs(e[x][i], x);
    }
}
int lca(int x, int y)
{
    if (dep[x] < dep[y])
        swap(x, y);
    for (int i = 20; ~i; i--)
        if (dep[fa[x][i]] >= dep[y])
            x = fa[x][i];
    if (x == y)
        return y;
    for (int i = 20; i >= 0; i--)
        if (fa[x][i] != fa[y][i])
            x = fa[x][i], y = fa[y][i];
    return fa[x][0];
}
void dfsa(int s, int fa)
{
    ans[s] += 1;
    for (auto i : e[s])
    {
        if (i == fa)
            continue;
        else
        {
            dfsa(i, s);
            ans[s] += ans[i];
        }
    }
}
int main()
{
    Paddi;
    int T;
    cin >> T;
    for (int tt = 1; tt <= T; tt++)
    {
        cout << "Case #" << tt << ": ";
        cin >> n;
        init();
        for (int i = 1; i <= n - 1; i++)
        {
            int x, y;
            cin >> x >> y;
            e[x].push_back(y), e[y].push_back(x);
        }
        dfs(1, 0);
        for (int i = 1; i <= n - 1; i++)
        {
            int l = lca(i, i + 1);
            ans[l]--;
        }
        dfsa(1, 0);
        for (int i = 1; i <= n; i++)
        {
            if (i == n)
                cout << ans[i] << endl;
            else
                cout << ans[i] << " ";
        }
    }
}