Educational Codeforces Round 2 E - Lomsat gelral（树形dp+启发式合并）

最新推荐文章于 2024-03-01 09:53:10 发布

TaoSama

最新推荐文章于 2024-03-01 09:53:10 发布

阅读量632

点赞数

分类专栏：动态规划文章标签： dp 启发式合并

本文链接：https://blog.csdn.net/lwt36/article/details/50571908

版权

动态规划专栏收录该内容

135 篇文章 0 订阅

订阅专栏

题意:

$给定N\le 10^5的一棵树, 每个节点有一个颜色, 求出每个节点所在子树中出现最多的颜色的颜色ID和$

分析:

$显然的树形dp$
$cnt[u][i]:=以u为根的子树中颜色i出现了几次$
$sum[u][i]:=以u为根的子树中出现i次的颜色的ID和$
$显然ans = sum[u][maxi]$
$由于i状态稀疏, 使用map$
$在自底向上转移的过程中, 将小的集合向的大集合启发式合并, 复杂度O(logn), 参考并查集按秩启发式合并$
$乘上map本身logn复杂度, 总体复杂度为O(nlog^2n)$

代码:

//
//  Created by TaoSama on 2016-01-21
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, c[N];
vector<int> G[N];

typedef long long LL;
map<int, int> cnt[N];
map<int, LL> sum[N];
LL ans[N];

void dfs(int u, int f) {
    cnt[u][c[u]] = 1;
    sum[u][1] = c[u];
    for(int v : G[u]) {
        if(v == f) continue;
        dfs(v, u);
        if(cnt[v].size() > cnt[u].size()) {
            swap(cnt[u], cnt[v]);
            swap(sum[u], sum[v]);
        }
        for(auto x : cnt[v]) {
            int color = x.first, times = x.second;
            int original = cnt[u][color];
            if(original && !(sum[u][original] -= color))
                sum[u].erase(original);
            cnt[u][color] = (original += times);
            sum[u][original] += color;
        }
    }
    ans[u] = sum[u].rbegin()->second;
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d", &n) == 1) {
        for(int i = 1; i <= n; ++i) {G[i].clear(); cnt[i].clear(); sum[i].clear();}
        for(int i = 1; i <= n; ++i) scanf("%d", c + i);
        for(int i = 1; i < n; ++i) {
            int u, v; scanf("%d%d", &u, &v);
            G[u].push_back(v);
            G[v].push_back(u);
        }
        dfs(1, -1);
        for(int i = 1; i <= n; ++i)
            printf("%I64d%c", ans[i], " \n"[i == n]);
    }
    return 0;
}