-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathglobf.cpp
107 lines (87 loc) · 2.15 KB
/
globf.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using vpi = vector<pi>;
using vb = vector<bool>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vi a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<set<ll>> ed(n);
for (ll i = 0; i < n - 1; i++) {
ll u, v;
cin >> u >> v;
u--, v--;
ed[u].insert(v);
ed[v].insert(u);
}
vi cst(n);
vi mx(n);
function<void(ll, ll)> dfs2 = [&](ll v, ll p) {
}
function<void(ll, ll)> dfs = [&](ll v, ll p) {
if (v == 0) {
ll mxv = 0;
ll tot = 0;
ll mxi = -1;
ll mxv2 = 0;
ll mxi2 = -1;
for (ll ch : ed[v]) {
if (ch != p) {
dfs(ch, v);
if (mx[ch] > mxv) {
mxv = mx[ch];
mxi = ch;
}
tot += cst[ch];
}
}
for (ll ch : ed[v]) {
if (ch != p) {
if (mx[ch] > mxv2 && ch != mxi) {
mxv2 = mx[ch];
mxi2 = ch;
}
}
}
if (a[v] > mxv) {
tot += a[v] - mxv;
mxv = a[v];
}
if (mxi2 == -1)
tot += mxv;
else if (a[v] > mxv2) {
tot += a[v] - mxv2;
mxv2 = a[v];
}
cst[v] = tot;
mx[v] = mxv;
} else {
ll mxv = 0;
ll tot = 0;
for (ll ch : ed[v]) {
if (ch != p) {
dfs(ch, v);
mxv = max(mxv, mx[ch]);
tot += cst[ch];
}
}
if (a[v] > mxv) {
tot += a[v] - mxv;
mxv = a[v];
}
cst[v] = tot;
mx[v] = mxv;
}
};
dfs(0, -1);
cout << cst[0] << endl;
return 0;
}