最富裕的小家庭（华为OD D卷）

枍谷

于 2024-04-15 21:35:52 发布

阅读量204

点赞数 3

CC 4.0 BY-SA版权

文章标签：华为od 链表算法

本文链接：https://blog.csdn.net/tianmayimeng/article/details/137796602

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int n;
    while (cin>>n){
        vector<int> money(n+1);
        for (int i = 1; i <= n; ++i) {
            cin>>money[i];
        }
        int child,father;
        vector<int> family(money);
        for (int i = 0; i < n-1; ++i) {
            cin>>father>>child;
            family[father] += money[child];
        }
        int ans = *max_element(family.begin(), family.end());
        cout<<ans<<endl;
    }

    return 0;
}