Pagini recente » Cod sursa (job #2861615) | Cod sursa (job #1912952) | Cod sursa (job #1200751) | Cod sursa (job #3176404) | Cod sursa (job #2947167)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
int n;
int v[16001];
int root;
vector<int> m[16001];
bool viz[16001];
void calc(int i) {
for (int k : m[i]) {
if (!viz[k]) {
viz[k] = 1;
calc(k);
if (v[k] > 0) {
v[i] += v[k];
}
}
}
}
int main() {
fin >> n;
root = n * (n + 1) / 2;
for (int i = 1; i <= n; i++) {
fin >> v[i];
}
int x, y;
for (int i = 0; i < n - 1; i++) {
fin >> x >> y;
m[x].push_back(y);
m[y].push_back(x);
}
viz[1] = 1;
calc(1);
int smax = v[1];
for (int i = 2; i <= n; i++) {
// fout << v[i] << " ";
smax = max(smax, v[i]);
}
// fout << "\n";
fout << smax;
}