Pagini recente » Cod sursa (job #2758502) | Cod sursa (job #1864048) | Cod sursa (job #239386) | Cod sursa (job #517261) | Cod sursa (job #1068842)
#include <fstream>
#include <vector>
#define Inf -10000000
using namespace std;
vector<int> l[16005];
int n, v[16005], i, Max=Inf, a, b;
bool ok[16005];
void dfs(int x) {
ok[x]=1;
for(int i=0;i<l[x].size();i++) {
int y=l[x][i];
if(ok[y]==0) {
dfs(y);
if(v[y]>0)
v[x]+=v[y];
}
}
if(Max<v[x])
Max=v[x];
}
int main() {
ifstream f("asmax.in");
ofstream g("asmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<n;i++) {
f>>a>>b;
l[a].push_back(b);
l[b].push_back(a);
}
dfs(1);
g<<Max<<"\n";
f.close();
g.close();
return 0;
}