Pagini recente » Cod sursa (job #3152879) | Cod sursa (job #2880203) | Cod sursa (job #2666216) | Cod sursa (job #2166424) | Cod sursa (job #1540758)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
int n, x, y, mx=-99999, gg;
int v[16010];
vector <int> a[16010];
bitset <16010> b;
int dfs(int k){
int sum=v[k];
b[k]=true;
for(int i=0;i<a[k].size();++i){
gg=a[k][i];
if(!b[gg]){
b[gg]=true;
int hh=dfs(gg);
if(hh>0) sum+=hh;
}
}
mx=max(sum, mx);
return sum;
}
int main(){
fin>>n;
for(int i=1;i<=n;++i) fin>>v[i];
for(int i=1;i<=n-1;++i){
fin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
dfs(1);
fout<<mx;
return 0;
}