Pagini recente » Cod sursa (job #1984834) | Cod sursa (job #290061) | Cod sursa (job #1048377) | Cod sursa (job #643411) | Cod sursa (job #2136024)
#include<fstream>
#include<vector>
using namespace std;
const int MAX=100005;
vector<int> a[MAX];
bool viz[MAX];
int m, n, y, v[MAX];
ifstream cin("asmax.in");
ofstream cout("asmax.out");
void citire(){
cin>>n;
int x, y, k;
for(int i=1; i<=n; i++){
cin>>k;
v[i]=k;
}
m=n-1;
for(int i=0; i<m; i++){
cin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
}
void dfs(int x){
viz[x]=true;
int y;
for(int i=0; i<a[x].size(); i++){
y=a[x][i];
if(!viz[y]){
dfs(y);
if(v[y]>0){
v[x]+=v[y];
}
}
}
}
int main(){
citire();
int maxm=-999999999;
for(int i=1; i<=n; i++){
if(!viz[i]){
dfs(i);
}
}
for(int i=1; i<=n; i++){
if(maxm<v[i])
maxm=v[i];
}
cout<<maxm;
return 0;
}