Pagini recente » Cod sursa (job #1623052) | Cod sursa (job #724740) | Cod sursa (job #777550) | Cod sursa (job #262384) | Cod sursa (job #1599244)
#include <iostream>
#include <stdio.h>
#include <vector>
#define NMax 16003
using namespace std;
vector<int> Graf[NMax];
int v[NMax*2-2],N,M,x,y,Max;
bool mark[NMax];
void Read()
{
scanf("%d",&N);
for(int i=1;i<=N;i++)
scanf("%d",&v[i]);
for(int i=1;i<N;i++)
{
scanf("%d%d",&x,&y);
Graf[x].push_back(y);
Graf[y].push_back(x);
}
}
void DFS(int nod)
{
for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
if(mark[*it]==false)
{
mark[*it]=true;
v[nod]=max(v[nod],v[*it]+v[nod]);
DFS(*it);
}
Max=max(Max,v[nod]);
}
int main()
{
freopen("asmax.in","r",stdin);
freopen("asmax.out","w",stdout);
Read();
DFS(1);
printf("%d ",Max);
}