Pagini recente » Cod sursa (job #178097) | Cod sursa (job #880064) | Monitorul de evaluare | Statistici Petrovici Constantin (ConstantinPetrovici) | Cod sursa (job #2704869)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("asmax.in");
ofstream cout("asmax.out");
const int N=16002;
int val[N],sum[N];
int n,x,y,maxi=-1002;
bool viz[N];
vector<int>v[N];
void dfs(int nod)
{
viz[nod]=1;
for(size_t i=0;i<v[nod].size();i++)
{
if(!viz[v[nod][i]])
{
dfs(v[nod][i]);
if(sum[v[nod][i]]>0)
{
sum[nod]+=sum[v[nod][i]];
}
}
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>val[i];
sum[i]=val[i];
}
for(int i=1;i<=n-1;i++)
{
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
for(int i=1;i<=n;i++)
{
if(sum[i]>maxi)
{
maxi=sum[i];
}
}
cout<<maxi;
return 0;
}