SGU143 Long Live the Queen

最新推荐文章于 2018-03-27 12:59:29 发布

SYSU_LoveBY

最新推荐文章于 2018-03-27 12:59:29 发布

阅读量455

点赞数

分类专栏： SGU 文章标签： SGU DFS

本文链接：https://blog.csdn.net/u010929036/article/details/46540509

版权

SGU 专栏收录该内容

47 篇文章 0 订阅

订阅专栏

SGU143 Long Live the Queen

题目大意

给出一棵树，找出权值和最大的一棵子树

算法思路

DFS，此节点为根的子树的最大值，等于该节点的值加上孩子中非负的最大值
再用上面的值与下面所有子树中的答案取最大的作为该子树的答案

时间复杂度: $O(N)$

代码

/**
 * Copyright © 2015 Authors. All rights reserved.
 * 
 * FileName: 143.cpp
 * Author: Beiyu Li <sysulby@gmail.com>
 * Date: 2015-06-18
 */
#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)

typedef long long LL;
typedef pair<int, int> Pii;

const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;

const int maxn = 16000 + 5;

int n, psz;
struct Edge {
        int v;
        Edge *next;
} epool[maxn*2], *e[maxn];
int val[maxn];

void add_edge(int u, int v)
{
        Edge *i = epool + psz++;
        i->v = v; i->next = e[u]; e[u] = i;
}

int dfs(int u, int f)
{
        int ret = -inf;
        for (Edge *i = e[u]; i; i = i->next) {
                int v = i->v;
                if (v == f) continue;
                ret = max(ret, dfs(v, u));
                if (val[v] > 0) val[u] += val[v];
        }
        return max(ret, val[u]);
}

int main()
{
        scanf("%d", &n);
        rep(i,n) scanf("%d", &val[i]);
        rep(i,n-1) {
                int u, v;
                scanf("%d%d", &u, &v);
                --u, --v;
                add_edge(u, v);
                add_edge(v, u);
        }
        printf("%d\n", dfs(0, -1));

        return 0;
}