-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path143.cpp
58 lines (49 loc) · 1.09 KB
/
143.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
// in the name of God
# include <bits/stdc++.h>
using namespace std;
# define pb push_back
# define slark cerr << "slark" << endl;
# define dagon cout << endl;
# define XX first
# define YY second
# define err(x) cout << #x << " is: " << x << endl;
# define Wait() int _; cin >> _;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
const double PI = 3.1415931;
const double eps = 1e-9;
const int maxN = 16000 + 10;
int dp[maxN], profit[maxN];
vector<int> v[maxN];
bool mark[maxN];
void dfs(int x) {
mark[x] = true;
dp[x] = profit[x];
for (int nei:v[x]) {
if (!mark[nei]) {
dfs(nei);
if (dp[nei] > 0) {
dp[x] += dp[nei];
}
}
}
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> profit[i];
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
dfs(1);
cout << *max_element(dp + 1, dp + 1 + n) << endl;
return 0;
}