Pagini recente » Cod sursa (job #668935) | Cod sursa (job #2500708) | Cod sursa (job #622690) | Cod sursa (job #727599) | Cod sursa (job #2955188)
#include <fstream>
#include<vector>
#define NMAX 16001
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
int n,m,x,y,cost[NMAX],s[NMAX],sol=-NMAX*1000;
vector<int>v[NMAX];
bool viz[NMAX];
void dfs(int nod)
{
viz[nod]=1;
s[nod]=cost[nod];
for(int i=0;i<v[nod].size();i++)
{
int nod1=v[nod][i];
if(viz[nod1]==0)
{
dfs(nod1);
if(s[nod]+s[nod1]>s[nod])
s[nod]+=s[nod1];
}
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>cost[i];
for(int i=1;i<n;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
for(int i=1;i<=n;i++)
{
sol=max(sol,s[i]);
}
fout<<sol;
return 0;
}